./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:16,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:16,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:16,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:16,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:16,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:16,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:16,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:16,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:16,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:16,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:16,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:16,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:16,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:16,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:16,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:16,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:16,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:16,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:16,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:16,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:16,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:16,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:16,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:16,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:16,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:16,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:16,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:16,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:16,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:16,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:16,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:16,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:16,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:16,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:16,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:16,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:16,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:16,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:16,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:16,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:16,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-10-22 09:00:16,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:16,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:16,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:16,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:16,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:16,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:16,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:16,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:16,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:16,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:16,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:16,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:16,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:16,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:16,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:16,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:16,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2019-10-22 09:00:16,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:16,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:16,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:16,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:16,489 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:16,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-10-22 09:00:16,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/data/5bb6c4ddd/262a9dabd4b64bfb831c0d6a6927bb60/FLAG0b81b4726 [2019-10-22 09:00:16,884 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:16,885 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-10-22 09:00:16,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/data/5bb6c4ddd/262a9dabd4b64bfb831c0d6a6927bb60/FLAG0b81b4726 [2019-10-22 09:00:16,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/data/5bb6c4ddd/262a9dabd4b64bfb831c0d6a6927bb60 [2019-10-22 09:00:16,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:16,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-10-22 09:00:16,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:16,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:16,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:16,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:16" (1/1) ... [2019-10-22 09:00:16,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d9ec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:16, skipping insertion in model container [2019-10-22 09:00:16,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:16" (1/1) ... [2019-10-22 09:00:16,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:16,937 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:17,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:17,188 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:17,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:17,230 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:17,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17 WrapperNode [2019-10-22 09:00:17,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:17,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:17,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:17,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:17,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... [2019-10-22 09:00:17,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:17,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:17,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:17,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:17,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/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 [2019-10-22 09:00:17,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-10-22 09:00:17,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-22 09:00:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-22 09:00:17,328 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-10-22 09:00:17,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-22 09:00:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-22 09:00:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:00:17,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:17,763 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:17,763 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:00:17,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:17 BoogieIcfgContainer [2019-10-22 09:00:17,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:17,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:17,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:17,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:17,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:16" (1/3) ... [2019-10-22 09:00:17,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b56175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:17, skipping insertion in model container [2019-10-22 09:00:17,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:17" (2/3) ... [2019-10-22 09:00:17,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b56175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:17, skipping insertion in model container [2019-10-22 09:00:17,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:17" (3/3) ... [2019-10-22 09:00:17,772 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2019-10-22 09:00:17,780 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:17,787 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-22 09:00:17,797 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-22 09:00:17,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:17,815 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 09:00:17,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:17,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:17,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:17,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:17,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:17,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-10-22 09:00:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:00:17,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:17,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:17,841 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-10-22 09:00:17,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:17,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987846220] [2019-10-22 09:00:17,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:17,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:18,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987846220] [2019-10-22 09:00:18,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:18,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:18,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333581999] [2019-10-22 09:00:18,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:18,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:18,166 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-10-22 09:00:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:18,445 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-10-22 09:00:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:18,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:00:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:18,456 INFO L225 Difference]: With dead ends: 87 [2019-10-22 09:00:18,456 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 09:00:18,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 09:00:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2019-10-22 09:00:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 09:00:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-22 09:00:18,496 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2019-10-22 09:00:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:18,496 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-22 09:00:18,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-22 09:00:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:00:18,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:18,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:18,497 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-10-22 09:00:18,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:18,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63064786] [2019-10-22 09:00:18,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:18,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:18,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:18,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63064786] [2019-10-22 09:00:18,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:18,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:18,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048983262] [2019-10-22 09:00:18,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:18,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:18,695 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-22 09:00:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:19,001 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-22 09:00:19,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:19,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 09:00:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:19,002 INFO L225 Difference]: With dead ends: 69 [2019-10-22 09:00:19,002 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 09:00:19,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 09:00:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-22 09:00:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 09:00:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-22 09:00:19,012 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 12 [2019-10-22 09:00:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:19,012 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-22 09:00:19,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-22 09:00:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:00:19,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:19,013 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:19,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-10-22 09:00:19,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038309130] [2019-10-22 09:00:19,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038309130] [2019-10-22 09:00:19,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179273042] [2019-10-22 09:00:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:00:19,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:19,310 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 12=[|v_#valid_37|]} [2019-10-22 09:00:19,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-10-22 09:00:19,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:19,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:19,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:19,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:19,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 83 [2019-10-22 09:00:19,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:19,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:19,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:19,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:19,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:19,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:19,455 INFO L567 ElimStorePlain]: treesize reduction 93, result has 28.5 percent of original size [2019-10-22 09:00:19,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:19,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-10-22 09:00:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,598 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:19,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-10-22 09:00:19,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498173555] [2019-10-22 09:00:19,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:00:19,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:19,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:19,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:19,601 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 10 states. [2019-10-22 09:00:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:20,043 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-22 09:00:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:20,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-10-22 09:00:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:20,045 INFO L225 Difference]: With dead ends: 75 [2019-10-22 09:00:20,045 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 09:00:20,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 09:00:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-10-22 09:00:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 09:00:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-22 09:00:20,051 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 15 [2019-10-22 09:00:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:20,051 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-22 09:00:20,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:00:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-22 09:00:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 09:00:20,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:20,052 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:20,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:20,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -355499218, now seen corresponding path program 2 times [2019-10-22 09:00:20,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:20,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979741247] [2019-10-22 09:00:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:20,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979741247] [2019-10-22 09:00:20,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288213617] [2019-10-22 09:00:20,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:20,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:20,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:20,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 09:00:20,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:20,724 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 12=[|v_#valid_38|]} [2019-10-22 09:00:20,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-10-22 09:00:20,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:20,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:20,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:20,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2019-10-22 09:00:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,835 INFO L567 ElimStorePlain]: treesize reduction 178, result has 16.8 percent of original size [2019-10-22 09:00:20,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:20,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-10-22 09:00:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:21,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2019-10-22 09:00:21,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060180243] [2019-10-22 09:00:21,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:00:21,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:21,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:00:21,048 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 8 states. [2019-10-22 09:00:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,145 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-10-22 09:00:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:21,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-10-22 09:00:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,149 INFO L225 Difference]: With dead ends: 74 [2019-10-22 09:00:21,149 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 09:00:21,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:00:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 09:00:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-22 09:00:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 09:00:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-22 09:00:21,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2019-10-22 09:00:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,155 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-22 09:00:21,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:00:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-22 09:00:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:00:21,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,156 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:21,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash -16477363, now seen corresponding path program 1 times [2019-10-22 09:00:21,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114326149] [2019-10-22 09:00:21,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:21,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114326149] [2019-10-22 09:00:21,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:21,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:21,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562566825] [2019-10-22 09:00:21,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:00:21,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:00:21,482 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2019-10-22 09:00:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,678 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-22 09:00:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:21,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-10-22 09:00:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,680 INFO L225 Difference]: With dead ends: 71 [2019-10-22 09:00:21,680 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 09:00:21,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 09:00:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-22 09:00:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 09:00:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-22 09:00:21,684 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2019-10-22 09:00:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,685 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-22 09:00:21,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:00:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-22 09:00:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:00:21,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,687 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,687 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 1 times [2019-10-22 09:00:21,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424329269] [2019-10-22 09:00:21,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424329269] [2019-10-22 09:00:21,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774398620] [2019-10-22 09:00:21,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:21,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:21,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 11 [2019-10-22 09:00:21,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477038360] [2019-10-22 09:00:21,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 09:00:21,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 09:00:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:00:21,886 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 11 states. [2019-10-22 09:00:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:22,121 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-10-22 09:00:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:22,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-22 09:00:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:22,121 INFO L225 Difference]: With dead ends: 76 [2019-10-22 09:00:22,122 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 09:00:22,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:00:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 09:00:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-22 09:00:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 09:00:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-22 09:00:22,126 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 26 [2019-10-22 09:00:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:22,126 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-22 09:00:22,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 09:00:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-22 09:00:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:00:22,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:22,127 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:22,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:22,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 2 times [2019-10-22 09:00:22,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:22,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017847066] [2019-10-22 09:00:22,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:22,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:22,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:22,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017847066] [2019-10-22 09:00:22,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005539019] [2019-10-22 09:00:22,497 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:22,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:00:22,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:22,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 09:00:22,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:22,561 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 12=[|v_#valid_39|]} [2019-10-22 09:00:22,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-10-22 09:00:22,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:22,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:22,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:22,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:22,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 109 [2019-10-22 09:00:22,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:22,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:22,666 INFO L567 ElimStorePlain]: treesize reduction 148, result has 19.6 percent of original size [2019-10-22 09:00:22,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:22,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:36 [2019-10-22 09:00:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 09:00:22,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:22,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 17 [2019-10-22 09:00:22,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250734822] [2019-10-22 09:00:22,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:00:22,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:00:22,865 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 7 states. [2019-10-22 09:00:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:23,092 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-10-22 09:00:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:23,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-10-22 09:00:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:23,094 INFO L225 Difference]: With dead ends: 74 [2019-10-22 09:00:23,094 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 09:00:23,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 09:00:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 09:00:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 09:00:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-22 09:00:23,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2019-10-22 09:00:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:23,100 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-22 09:00:23,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:00:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-22 09:00:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:00:23,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:23,101 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:23,302 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 1 times [2019-10-22 09:00:23,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202534585] [2019-10-22 09:00:23,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 09:00:23,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202534585] [2019-10-22 09:00:23,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:23,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:23,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444495932] [2019-10-22 09:00:23,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:23,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:23,392 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 5 states. [2019-10-22 09:00:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:23,550 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-22 09:00:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:23,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 09:00:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:23,551 INFO L225 Difference]: With dead ends: 73 [2019-10-22 09:00:23,551 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 09:00:23,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 09:00:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 09:00:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 09:00:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-22 09:00:23,556 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2019-10-22 09:00:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:23,556 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-22 09:00:23,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-22 09:00:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:00:23,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:23,557 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:23,557 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905532, now seen corresponding path program 1 times [2019-10-22 09:00:23,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:23,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117487857] [2019-10-22 09:00:23,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:23,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117487857] [2019-10-22 09:00:23,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692418635] [2019-10-22 09:00:23,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:23,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:23,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:23,750 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:23,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-10-22 09:00:23,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913296760] [2019-10-22 09:00:23,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 09:00:23,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:00:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:00:23,754 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2019-10-22 09:00:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:23,899 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-22 09:00:23,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:23,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-22 09:00:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:23,901 INFO L225 Difference]: With dead ends: 78 [2019-10-22 09:00:23,901 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 09:00:23,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 09:00:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-22 09:00:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 09:00:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-10-22 09:00:23,905 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 30 [2019-10-22 09:00:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:23,905 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-10-22 09:00:23,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 09:00:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-10-22 09:00:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 09:00:23,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:23,906 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:24,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:24,113 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 532455403, now seen corresponding path program 2 times [2019-10-22 09:00:24,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568333625] [2019-10-22 09:00:24,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:24,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568333625] [2019-10-22 09:00:24,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665356145] [2019-10-22 09:00:24,216 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:24,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:00:24,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:24,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:24,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:24,266 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 8=[|v_#valid_40|]} [2019-10-22 09:00:24,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,289 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 09:00:24,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2019-10-22 09:00:24,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:24,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:24,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:24,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-10-22 09:00:24,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-22 09:00:24,331 INFO L567 ElimStorePlain]: treesize reduction 17, result has 66.0 percent of original size [2019-10-22 09:00:24,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:24,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-10-22 09:00:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:00:24,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:24,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-10-22 09:00:24,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401843664] [2019-10-22 09:00:24,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:24,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:24,432 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2019-10-22 09:00:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:24,494 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-22 09:00:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:24,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 09:00:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:24,496 INFO L225 Difference]: With dead ends: 75 [2019-10-22 09:00:24,496 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 09:00:24,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:00:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 09:00:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-22 09:00:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 09:00:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-22 09:00:24,499 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 33 [2019-10-22 09:00:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-22 09:00:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-22 09:00:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 09:00:24,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:24,501 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 09:00:24,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:24,701 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1031100925, now seen corresponding path program 1 times [2019-10-22 09:00:24,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634591218] [2019-10-22 09:00:24,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:00:24,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634591218] [2019-10-22 09:00:24,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014546134] [2019-10-22 09:00:24,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:24,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:24,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:24,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-22 09:00:24,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957707554] [2019-10-22 09:00:24,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:00:24,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:00:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:24,912 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 14 states. [2019-10-22 09:00:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:25,075 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-10-22 09:00:25,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:25,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-10-22 09:00:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:25,076 INFO L225 Difference]: With dead ends: 93 [2019-10-22 09:00:25,076 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 09:00:25,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 09:00:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-10-22 09:00:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 09:00:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-10-22 09:00:25,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 42 [2019-10-22 09:00:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:25,079 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-10-22 09:00:25,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:00:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-10-22 09:00:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:00:25,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:25,080 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2019-10-22 09:00:25,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:25,281 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402646, now seen corresponding path program 2 times [2019-10-22 09:00:25,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803462477] [2019-10-22 09:00:25,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-22 09:00:25,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803462477] [2019-10-22 09:00:25,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:25,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:25,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58931281] [2019-10-22 09:00:25,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:00:25,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:00:25,374 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 8 states. [2019-10-22 09:00:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:25,567 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-22 09:00:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:25,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-22 09:00:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:25,568 INFO L225 Difference]: With dead ends: 84 [2019-10-22 09:00:25,568 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 09:00:25,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 09:00:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-22 09:00:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:00:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-10-22 09:00:25,572 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 50 [2019-10-22 09:00:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:25,572 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-10-22 09:00:25,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:00:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-10-22 09:00:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:00:25,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:25,573 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2019-10-22 09:00:25,574 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402647, now seen corresponding path program 1 times [2019-10-22 09:00:25,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809524596] [2019-10-22 09:00:25,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:25,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809524596] [2019-10-22 09:00:25,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62810270] [2019-10-22 09:00:25,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:25,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:25,780 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:25,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2019-10-22 09:00:25,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131602933] [2019-10-22 09:00:25,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:00:25,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:00:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:25,781 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 14 states. [2019-10-22 09:00:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:25,931 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-10-22 09:00:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:00:25,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-10-22 09:00:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:25,932 INFO L225 Difference]: With dead ends: 87 [2019-10-22 09:00:25,932 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 09:00:25,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 09:00:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-22 09:00:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 09:00:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-22 09:00:25,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2019-10-22 09:00:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:25,940 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-22 09:00:25,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:00:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-22 09:00:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:00:25,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:25,941 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-10-22 09:00:26,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:26,146 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1417170302, now seen corresponding path program 2 times [2019-10-22 09:00:26,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721443133] [2019-10-22 09:00:26,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:26,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721443133] [2019-10-22 09:00:26,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113908707] [2019-10-22 09:00:26,448 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:26,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:00:26,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:26,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-22 09:00:26,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,514 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 8=[|v_#valid_41|]} [2019-10-22 09:00:26,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,527 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 09:00:26,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2019-10-22 09:00:26,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:26,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:26,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:00:26,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-10-22 09:00:26,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-22 09:00:26,571 INFO L567 ElimStorePlain]: treesize reduction 17, result has 66.0 percent of original size [2019-10-22 09:00:26,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:26,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:32 [2019-10-22 09:00:26,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:26,765 INFO L375 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 126 [2019-10-22 09:00:26,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:26,827 INFO L567 ElimStorePlain]: treesize reduction 52, result has 51.9 percent of original size [2019-10-22 09:00:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:26,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:26,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:56 [2019-10-22 09:00:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:27,051 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-10-22 09:00:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:00:27,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:27,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 24 [2019-10-22 09:00:27,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322750080] [2019-10-22 09:00:27,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:00:27,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-10-22 09:00:27,079 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 7 states. [2019-10-22 09:00:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:27,209 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-10-22 09:00:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:27,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 09:00:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:27,210 INFO L225 Difference]: With dead ends: 85 [2019-10-22 09:00:27,210 INFO L226 Difference]: Without dead ends: 85 [2019-10-22 09:00:27,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-22 09:00:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-22 09:00:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-22 09:00:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 09:00:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-22 09:00:27,213 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 53 [2019-10-22 09:00:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:27,214 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-22 09:00:27,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:00:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-22 09:00:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:00:27,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:27,215 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-10-22 09:00:27,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:27,416 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,416 INFO L82 PathProgramCache]: Analyzing trace with hash 982606402, now seen corresponding path program 1 times [2019-10-22 09:00:27,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750660919] [2019-10-22 09:00:27,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:00:27,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750660919] [2019-10-22 09:00:27,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:27,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:27,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720682698] [2019-10-22 09:00:27,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:27,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:27,492 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 5 states. [2019-10-22 09:00:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:27,606 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-10-22 09:00:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:27,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-22 09:00:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:27,607 INFO L225 Difference]: With dead ends: 84 [2019-10-22 09:00:27,607 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 09:00:27,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 09:00:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-22 09:00:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:00:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-10-22 09:00:27,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 54 [2019-10-22 09:00:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:27,611 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-10-22 09:00:27,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-10-22 09:00:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:00:27,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:27,612 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-10-22 09:00:27,612 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 982606403, now seen corresponding path program 1 times [2019-10-22 09:00:27,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159641802] [2019-10-22 09:00:27,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:27,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159641802] [2019-10-22 09:00:27,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761256088] [2019-10-22 09:00:27,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:27,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:00:27,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:27,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 20 [2019-10-22 09:00:27,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776246104] [2019-10-22 09:00:27,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:00:27,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:00:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:27,946 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2019-10-22 09:00:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:28,321 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-10-22 09:00:28,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:00:28,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-10-22 09:00:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:28,322 INFO L225 Difference]: With dead ends: 93 [2019-10-22 09:00:28,322 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 09:00:28,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2019-10-22 09:00:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 09:00:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-10-22 09:00:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 09:00:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-22 09:00:28,325 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2019-10-22 09:00:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:28,325 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-22 09:00:28,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:00:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-22 09:00:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:00:28,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:28,326 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 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] [2019-10-22 09:00:28,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:28,527 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 418358676, now seen corresponding path program 1 times [2019-10-22 09:00:28,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:28,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235990029] [2019-10-22 09:00:28,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:28,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235990029] [2019-10-22 09:00:28,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048946632] [2019-10-22 09:00:28,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-22 09:00:28,894 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:28,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 22 [2019-10-22 09:00:28,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355194276] [2019-10-22 09:00:28,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-22 09:00:28,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:28,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 09:00:28,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-10-22 09:00:28,895 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 22 states. [2019-10-22 09:00:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:29,335 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-10-22 09:00:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:00:29,336 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2019-10-22 09:00:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:29,336 INFO L225 Difference]: With dead ends: 94 [2019-10-22 09:00:29,336 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 09:00:29,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 09:00:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 09:00:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-10-22 09:00:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 09:00:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-10-22 09:00:29,339 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 62 [2019-10-22 09:00:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:29,339 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-10-22 09:00:29,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-22 09:00:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-10-22 09:00:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:00:29,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:29,340 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 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] [2019-10-22 09:00:29,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:29,541 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -12786245, now seen corresponding path program 2 times [2019-10-22 09:00:29,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:29,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133711810] [2019-10-22 09:00:29,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:29,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:29,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133711810] [2019-10-22 09:00:29,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804815296] [2019-10-22 09:00:29,825 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:29,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:00:29,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:29,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 09:00:29,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:29,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:29,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:29,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:00:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 09:00:30,032 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:30,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 28 [2019-10-22 09:00:30,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702897393] [2019-10-22 09:00:30,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-22 09:00:30,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-22 09:00:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-10-22 09:00:30,035 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 28 states. [2019-10-22 09:00:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:30,613 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-10-22 09:00:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-22 09:00:30,613 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-10-22 09:00:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:30,614 INFO L225 Difference]: With dead ends: 98 [2019-10-22 09:00:30,614 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 09:00:30,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1832, Unknown=0, NotChecked=0, Total=2162 [2019-10-22 09:00:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 09:00:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2019-10-22 09:00:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 09:00:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-10-22 09:00:30,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 65 [2019-10-22 09:00:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:30,618 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-10-22 09:00:30,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-22 09:00:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-10-22 09:00:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 09:00:30,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:30,620 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:30,821 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1232777274, now seen corresponding path program 1 times [2019-10-22 09:00:30,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230745418] [2019-10-22 09:00:30,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-22 09:00:30,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230745418] [2019-10-22 09:00:30,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642093512] [2019-10-22 09:00:30,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-22 09:00:31,011 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:31,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-22 09:00:31,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915605022] [2019-10-22 09:00:31,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:00:31,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:31,012 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 10 states. [2019-10-22 09:00:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:31,161 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-10-22 09:00:31,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:31,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-10-22 09:00:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:31,162 INFO L225 Difference]: With dead ends: 110 [2019-10-22 09:00:31,162 INFO L226 Difference]: Without dead ends: 110 [2019-10-22 09:00:31,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-22 09:00:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-10-22 09:00:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 09:00:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2019-10-22 09:00:31,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 72 [2019-10-22 09:00:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:31,165 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2019-10-22 09:00:31,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:00:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2019-10-22 09:00:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:00:31,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:31,165 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:31,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:31,366 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2070663486, now seen corresponding path program 2 times [2019-10-22 09:00:31,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287336000] [2019-10-22 09:00:31,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:31,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287336000] [2019-10-22 09:00:31,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439821516] [2019-10-22 09:00:31,530 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:31,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:31,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:31,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:31,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-22 09:00:31,611 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:31,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2019-10-22 09:00:31,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748655057] [2019-10-22 09:00:31,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 09:00:31,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:00:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:31,612 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 12 states. [2019-10-22 09:00:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:31,677 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-10-22 09:00:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:31,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-10-22 09:00:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:31,678 INFO L225 Difference]: With dead ends: 111 [2019-10-22 09:00:31,678 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 09:00:31,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 09:00:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-10-22 09:00:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 09:00:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-22 09:00:31,681 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 82 [2019-10-22 09:00:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:31,681 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-22 09:00:31,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 09:00:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-22 09:00:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 09:00:31,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:31,682 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2019-10-22 09:00:31,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:31,883 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,883 INFO L82 PathProgramCache]: Analyzing trace with hash 213041488, now seen corresponding path program 3 times [2019-10-22 09:00:31,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939282666] [2019-10-22 09:00:31,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:32,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939282666] [2019-10-22 09:00:32,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989327002] [2019-10-22 09:00:32,042 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:32,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 09:00:32,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:32,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:32,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-10-22 09:00:32,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:32,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-22 09:00:32,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026893415] [2019-10-22 09:00:32,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 09:00:32,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:00:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:00:32,147 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 16 states. [2019-10-22 09:00:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,320 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-10-22 09:00:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:00:32,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-10-22 09:00:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:32,321 INFO L225 Difference]: With dead ends: 125 [2019-10-22 09:00:32,321 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 09:00:32,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:00:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 09:00:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-10-22 09:00:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 09:00:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-22 09:00:32,324 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 87 [2019-10-22 09:00:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:32,325 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-22 09:00:32,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 09:00:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-22 09:00:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:00:32,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:32,326 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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] [2019-10-22 09:00:32,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:32,526 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1799161800, now seen corresponding path program 4 times [2019-10-22 09:00:32,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417998213] [2019-10-22 09:00:32,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:32,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417998213] [2019-10-22 09:00:32,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941486479] [2019-10-22 09:00:32,741 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:32,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:00:32,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:32,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:32,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-22 09:00:32,823 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:32,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 15 [2019-10-22 09:00:32,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684919930] [2019-10-22 09:00:32,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 09:00:32,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:00:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:32,824 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2019-10-22 09:00:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:33,033 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-10-22 09:00:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:33,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-10-22 09:00:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:33,037 INFO L225 Difference]: With dead ends: 126 [2019-10-22 09:00:33,037 INFO L226 Difference]: Without dead ends: 126 [2019-10-22 09:00:33,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-22 09:00:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-10-22 09:00:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 09:00:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-10-22 09:00:33,040 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 97 [2019-10-22 09:00:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:33,040 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-10-22 09:00:33,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 09:00:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-10-22 09:00:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:00:33,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:33,041 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 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] [2019-10-22 09:00:33,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:33,243 INFO L410 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 852576122, now seen corresponding path program 5 times [2019-10-22 09:00:33,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226835219] [2019-10-22 09:00:33,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:33,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226835219] [2019-10-22 09:00:33,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881820488] [2019-10-22 09:00:33,454 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:34,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-22 09:00:34,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:34,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-22 09:00:34,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:34,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 16 [2019-10-22 09:00:34,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498617166] [2019-10-22 09:00:34,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 09:00:34,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:00:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:00:34,475 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 16 states. [2019-10-22 09:00:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:34,588 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-10-22 09:00:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:34,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-10-22 09:00:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:34,589 INFO L225 Difference]: With dead ends: 131 [2019-10-22 09:00:34,589 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 09:00:34,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:00:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 09:00:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-10-22 09:00:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-22 09:00:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-22 09:00:34,592 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 102 [2019-10-22 09:00:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:34,592 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-22 09:00:34,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 09:00:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-22 09:00:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-22 09:00:34,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:34,593 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 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] [2019-10-22 09:00:34,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:34,794 INFO L410 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1194653944, now seen corresponding path program 6 times [2019-10-22 09:00:34,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154963311] [2019-10-22 09:00:34,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:35,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154963311] [2019-10-22 09:00:35,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640423424] [2019-10-22 09:00:35,018 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:35,167 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-22 09:00:35,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:35,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-10-22 09:00:35,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:35,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 20 [2019-10-22 09:00:35,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450272344] [2019-10-22 09:00:35,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:00:35,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:00:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:35,214 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 20 states. [2019-10-22 09:00:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:35,398 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2019-10-22 09:00:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:00:35,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 107 [2019-10-22 09:00:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:35,399 INFO L225 Difference]: With dead ends: 145 [2019-10-22 09:00:35,399 INFO L226 Difference]: Without dead ends: 145 [2019-10-22 09:00:35,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-22 09:00:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2019-10-22 09:00:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 09:00:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-22 09:00:35,402 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 107 [2019-10-22 09:00:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:35,403 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-22 09:00:35,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:00:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-22 09:00:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 09:00:35,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:35,404 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:35,606 INFO L410 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1644855824, now seen corresponding path program 7 times [2019-10-22 09:00:35,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925200656] [2019-10-22 09:00:35,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:35,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925200656] [2019-10-22 09:00:35,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865073122] [2019-10-22 09:00:35,887 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-10-22 09:00:35,983 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:35,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 19 [2019-10-22 09:00:35,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244912354] [2019-10-22 09:00:35,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 09:00:35,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 09:00:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:00:35,984 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 19 states. [2019-10-22 09:00:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,125 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-10-22 09:00:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:00:36,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2019-10-22 09:00:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:36,126 INFO L225 Difference]: With dead ends: 146 [2019-10-22 09:00:36,126 INFO L226 Difference]: Without dead ends: 146 [2019-10-22 09:00:36,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:00:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-22 09:00:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-10-22 09:00:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-22 09:00:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2019-10-22 09:00:36,128 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 117 [2019-10-22 09:00:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:36,129 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2019-10-22 09:00:36,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 09:00:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2019-10-22 09:00:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 09:00:36,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:36,129 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:36,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:36,330 INFO L410 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash -27003710, now seen corresponding path program 8 times [2019-10-22 09:00:36,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893531759] [2019-10-22 09:00:36,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:00:36,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893531759] [2019-10-22 09:00:36,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570694754] [2019-10-22 09:00:36,604 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:36,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:36,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:36,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-10-22 09:00:36,700 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:36,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 20 [2019-10-22 09:00:36,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514212370] [2019-10-22 09:00:36,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:00:36,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:00:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:36,701 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 20 states. [2019-10-22 09:00:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,874 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2019-10-22 09:00:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 09:00:36,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2019-10-22 09:00:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:36,875 INFO L225 Difference]: With dead ends: 151 [2019-10-22 09:00:36,875 INFO L226 Difference]: Without dead ends: 151 [2019-10-22 09:00:36,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:00:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-22 09:00:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-10-22 09:00:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 09:00:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-22 09:00:36,884 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 122 [2019-10-22 09:00:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:36,884 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-22 09:00:36,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:00:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-22 09:00:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-22 09:00:36,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:36,886 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2019-10-22 09:00:37,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:37,086 INFO L410 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash -371170992, now seen corresponding path program 9 times [2019-10-22 09:00:37,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159417811] [2019-10-22 09:00:37,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:37,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159417811] [2019-10-22 09:00:37,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311370761] [2019-10-22 09:00:37,257 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:37,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-22 09:00:37,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:37,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:37,377 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:37,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-10-22 09:00:37,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864890535] [2019-10-22 09:00:37,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:00:37,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:37,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:37,378 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 10 states. [2019-10-22 09:00:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:37,510 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-10-22 09:00:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:37,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-10-22 09:00:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:37,511 INFO L225 Difference]: With dead ends: 156 [2019-10-22 09:00:37,511 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 09:00:37,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 09:00:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-10-22 09:00:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 09:00:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-10-22 09:00:37,515 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 127 [2019-10-22 09:00:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:37,515 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-10-22 09:00:37,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:00:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-10-22 09:00:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 09:00:37,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:37,516 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2019-10-22 09:00:37,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:37,717 INFO L410 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1244147386, now seen corresponding path program 10 times [2019-10-22 09:00:37,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694948084] [2019-10-22 09:00:37,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:37,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694948084] [2019-10-22 09:00:37,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987107675] [2019-10-22 09:00:37,883 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:38,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:00:38,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:38,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:38,095 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:38,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2019-10-22 09:00:38,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038551103] [2019-10-22 09:00:38,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 09:00:38,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 09:00:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:00:38,096 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 11 states. [2019-10-22 09:00:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:38,242 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-10-22 09:00:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:38,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2019-10-22 09:00:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:38,243 INFO L225 Difference]: With dead ends: 161 [2019-10-22 09:00:38,243 INFO L226 Difference]: Without dead ends: 161 [2019-10-22 09:00:38,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:00:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-22 09:00:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2019-10-22 09:00:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 09:00:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-22 09:00:38,247 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 132 [2019-10-22 09:00:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:38,247 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-22 09:00:38,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 09:00:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-22 09:00:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 09:00:38,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:38,249 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2019-10-22 09:00:38,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:38,450 INFO L410 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2070269040, now seen corresponding path program 11 times [2019-10-22 09:00:38,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:38,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738760544] [2019-10-22 09:00:38,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:38,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738760544] [2019-10-22 09:00:38,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421211808] [2019-10-22 09:00:38,632 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:46,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-22 09:00:46,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:46,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:46,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:46,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:46,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 12 [2019-10-22 09:00:46,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072919454] [2019-10-22 09:00:46,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 09:00:46,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:00:46,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:46,103 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 12 states. [2019-10-22 09:00:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:46,266 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-10-22 09:00:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:46,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-10-22 09:00:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:46,267 INFO L225 Difference]: With dead ends: 166 [2019-10-22 09:00:46,267 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 09:00:46,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:00:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 09:00:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-10-22 09:00:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-22 09:00:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2019-10-22 09:00:46,271 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 137 [2019-10-22 09:00:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:46,271 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2019-10-22 09:00:46,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 09:00:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2019-10-22 09:00:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-22 09:00:46,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:46,272 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2019-10-22 09:00:46,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:46,473 INFO L410 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:46,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1106756730, now seen corresponding path program 12 times [2019-10-22 09:00:46,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337384399] [2019-10-22 09:00:46,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:46,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337384399] [2019-10-22 09:00:46,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997308107] [2019-10-22 09:00:46,674 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:48,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-22 09:00:48,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:48,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-22 09:00:48,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 46 proven. 187 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-22 09:00:48,405 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:48,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2019-10-22 09:00:48,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456832388] [2019-10-22 09:00:48,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 09:00:48,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:00:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:00:48,408 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand 18 states. [2019-10-22 09:00:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:48,663 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-10-22 09:00:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 09:00:48,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2019-10-22 09:00:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:48,665 INFO L225 Difference]: With dead ends: 171 [2019-10-22 09:00:48,665 INFO L226 Difference]: Without dead ends: 171 [2019-10-22 09:00:48,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:00:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-22 09:00:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-22 09:00:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-22 09:00:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-22 09:00:48,669 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 142 [2019-10-22 09:00:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:48,669 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-22 09:00:48,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 09:00:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-22 09:00:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-22 09:00:48,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:48,670 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2019-10-22 09:00:48,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:48,870 INFO L410 AbstractCegarLoop]: === Iteration 31 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1612565040, now seen corresponding path program 13 times [2019-10-22 09:00:48,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292853564] [2019-10-22 09:00:48,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:49,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292853564] [2019-10-22 09:00:49,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707217904] [2019-10-22 09:00:49,083 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:49,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:49,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:49,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 14 [2019-10-22 09:00:49,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163387354] [2019-10-22 09:00:49,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:00:49,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:00:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:49,225 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 14 states. [2019-10-22 09:00:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:49,313 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2019-10-22 09:00:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:00:49,313 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2019-10-22 09:00:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:49,314 INFO L225 Difference]: With dead ends: 176 [2019-10-22 09:00:49,314 INFO L226 Difference]: Without dead ends: 176 [2019-10-22 09:00:49,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-22 09:00:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-10-22 09:00:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-22 09:00:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2019-10-22 09:00:49,319 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 147 [2019-10-22 09:00:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:49,319 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2019-10-22 09:00:49,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:00:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2019-10-22 09:00:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 09:00:49,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:49,320 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:49,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:49,521 INFO L410 AbstractCegarLoop]: === Iteration 32 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -896062918, now seen corresponding path program 14 times [2019-10-22 09:00:49,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:49,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371577652] [2019-10-22 09:00:49,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:49,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:49,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:49,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371577652] [2019-10-22 09:00:49,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442101415] [2019-10-22 09:00:49,762 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:49,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:49,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:49,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:49,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-22 09:00:49,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:49,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 15 [2019-10-22 09:00:49,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833902695] [2019-10-22 09:00:49,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 09:00:49,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:49,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:00:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:49,861 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 15 states. [2019-10-22 09:00:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:49,940 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2019-10-22 09:00:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:49,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 152 [2019-10-22 09:00:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:49,942 INFO L225 Difference]: With dead ends: 177 [2019-10-22 09:00:49,942 INFO L226 Difference]: Without dead ends: 177 [2019-10-22 09:00:49,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-22 09:00:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-10-22 09:00:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-22 09:00:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-22 09:00:49,945 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 152 [2019-10-22 09:00:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:49,945 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-22 09:00:49,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 09:00:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-22 09:00:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-22 09:00:49,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:49,947 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:50,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:50,147 INFO L410 AbstractCegarLoop]: === Iteration 33 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:00:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1136420880, now seen corresponding path program 15 times [2019-10-22 09:00:50,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846418011] [2019-10-22 09:00:50,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,478 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,478 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:00:50,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:00:50 BoogieIcfgContainer [2019-10-22 09:00:50,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:00:50,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:50,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:50,572 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:50,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:17" (3/4) ... [2019-10-22 09:00:50,576 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:00:50,658 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_81a338b8-db87-4a10-906d-025cc194d078/bin/uautomizer/witness.graphml [2019-10-22 09:00:50,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:50,666 INFO L168 Benchmark]: Toolchain (without parser) took 33759.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 948.7 MB in the beginning and 927.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 366.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:50,666 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:50,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:50,667 INFO L168 Benchmark]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:50,667 INFO L168 Benchmark]: RCFGBuilder took 497.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:50,667 INFO L168 Benchmark]: TraceAbstraction took 32805.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 939.6 MB in the end (delta: 168.0 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:50,668 INFO L168 Benchmark]: Witness Printer took 93.32 ms. Allocated memory is still 1.4 GB. Free memory was 939.6 MB in the beginning and 927.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:50,669 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 497.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32805.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 939.6 MB in the end (delta: 168.0 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. * Witness Printer took 93.32 ms. Allocated memory is still 1.4 GB. Free memory was 939.6 MB in the beginning and 927.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L45] CALL getNumbers4() VAL [array={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] CALL, EXPR getNumbers3() VAL [array={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] CALL, EXPR getNumbers2() VAL [array={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L16] CALL, EXPR getNumbers() VAL [array={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L8] int i = 0; VAL [array={-1:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=0, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=1, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=2, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=3, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=4, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=5, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=6, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=7, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=8, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L8] COND TRUE i < 10 VAL [array={-1:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L9] array[i] = i VAL [array={-1:0}, i=9, numbers2={-2:0}, numbers4={-3:0}] [L8] ++i VAL [array={-1:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L8] COND FALSE !(i < 10) VAL [array={-1:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L12] return array; VAL [\result={-1:0}, array={-1:0}, i=10, numbers2={-2:0}, numbers4={-3:0}] [L16] RET, EXPR getNumbers() VAL [array={-1:0}, getNumbers()={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={-1:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=0, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=0] [L18] ++i VAL [array={-1:0}, i=1, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=1, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=1, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=1, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=1] [L18] ++i VAL [array={-1:0}, i=2, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=2, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=2, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=2, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=2] [L18] ++i VAL [array={-1:0}, i=3, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=3, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=3, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=3, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=3] [L18] ++i VAL [array={-1:0}, i=4, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=4, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=4, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=4, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=4] [L18] ++i VAL [array={-1:0}, i=5, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=5, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=5, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=5, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=5] [L18] ++i VAL [array={-1:0}, i=6, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=6, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=6, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=6, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=6] [L18] ++i VAL [array={-1:0}, i=7, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=7, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=7, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=7, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=7] [L18] ++i VAL [array={-1:0}, i=8, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=8, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=8, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=8, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=8] [L18] ++i VAL [array={-1:0}, i=9, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND TRUE i < 10 VAL [array={-1:0}, i=9, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L19] EXPR numbers[i] VAL [array={-1:0}, i=9, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={-1:0}, i=9, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}, numbers[i]=9] [L18] ++i VAL [array={-1:0}, i=10, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L18] COND FALSE !(i < 10) VAL [array={-1:0}, i=10, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L21] return numbers2; VAL [\result={-2:0}, array={-1:0}, i=10, numbers={-1:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] RET, EXPR getNumbers2() VAL [array={-1:0}, getNumbers2()={-2:0}, numbers2={-2:0}, numbers4={-3:0}] [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={-1:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=0, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=0] [L27] ++i VAL [array={-1:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=1, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=1] [L27] ++i VAL [array={-1:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=2, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=2] [L27] ++i VAL [array={-1:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=3, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=3] [L27] ++i VAL [array={-1:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=4, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=4] [L27] ++i VAL [array={-1:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=5, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=5] [L27] ++i VAL [array={-1:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=6, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=6] [L27] ++i VAL [array={-1:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=7, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=7] [L27] ++i VAL [array={-1:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=8, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=8] [L27] ++i VAL [array={-1:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND TRUE i < 10 VAL [array={-1:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L28] EXPR numbers[i] VAL [array={-1:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={-1:0}, i=9, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}, numbers[i]=9] [L27] ++i VAL [array={-1:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L27] COND FALSE !(i < 10) VAL [array={-1:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers3={1:0}, numbers4={-3:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={1:0}, array={-1:0}, i=10, numbers={-2:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] RET, EXPR getNumbers3() VAL [array={-1:0}, getNumbers3()={1:0}, numbers2={-2:0}, numbers4={-3:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={-1:0}, i=0, numbers={1:0}, numbers2={-2:0}, numbers4={-3:0}] [L37] COND TRUE i < 10 VAL [array={-1:0}, i=0, numbers={1:0}, numbers2={-2:0}, numbers4={-3:0}] [L38] numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. Result: UNSAFE, OverallTime: 32.7s, OverallIterations: 33, TraceHistogramMax: 10, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1700 SDtfs, 1360 SDslu, 10211 SDs, 0 SdLazy, 5608 SolverSat, 358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2673 GetRequests, 2219 SyntacticMatches, 4 SemanticMatches, 450 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 114 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 11.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 4547 NumberOfCodeBlocks, 4331 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 4332 ConstructedInterpolants, 141 QuantifiedInterpolants, 1073749 SizeOfPredicates, 62 NumberOfNonLiveVariables, 7912 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 58 InterpolantComputations, 10 PerfectInterpolantSequences, 7574/11019 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...