./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 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/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 Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_14 (_ BitVec 32))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse1 (bvmul getNumbers_~i~0 (_ bv4 32))) (.cse0 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvadd |~#array~0.offset| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (bvsle .cse0 v_arrayElimCell_14) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_14)) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_14)) (and (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11) (bvsle .cse2 v_arrayElimCell_11) (not (bvsle .cse0 v_arrayElimCell_11))) (not (bvsle .cse2 v_arrayElimCell_14)))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:55:17,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:17,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:17,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:17,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:17,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:17,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:17,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:17,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:17,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:17,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:17,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:17,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:17,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:17,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:17,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:17,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:17,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:17,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:17,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:18,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:18,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:18,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:18,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:18,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:18,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:18,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:18,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:18,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:18,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:18,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:18,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:18,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:18,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:18,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:18,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:18,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:18,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:18,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:18,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:18,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:18,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 08:55:18,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:18,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:18,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:18,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:18,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:18,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:18,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:18,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:55:18,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:18,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:18,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:18,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 08:55:18,060 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 08:55:18,060 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 08:55:18,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:18,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:55:18,062 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:55:18,062 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:55:18,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:18,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:18,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:18,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:18,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:18,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:18,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:18,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:18,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:18,064 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:55:18,064 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:55:18,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:55:18,065 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/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-11-25 08:55:18,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:18,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:18,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:18,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:18,213 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:18,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-11-25 08:55:18,264 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/data/1692f24f3/53bd555b995d42c1a23ce6b8be214238/FLAG225b97f25 [2019-11-25 08:55:18,671 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:18,671 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-11-25 08:55:18,677 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/data/1692f24f3/53bd555b995d42c1a23ce6b8be214238/FLAG225b97f25 [2019-11-25 08:55:19,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/data/1692f24f3/53bd555b995d42c1a23ce6b8be214238 [2019-11-25 08:55:19,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:19,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 08:55:19,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:19,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:19,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:19,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33dc2604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19, skipping insertion in model container [2019-11-25 08:55:19,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:19,092 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:19,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:19,400 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:19,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:19,440 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:19,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19 WrapperNode [2019-11-25 08:55:19,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:19,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:19,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:19,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:19,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... [2019-11-25 08:55:19,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:19,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:19,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:19,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:19,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/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-11-25 08:55:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 08:55:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-11-25 08:55:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-11-25 08:55:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-11-25 08:55:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-11-25 08:55:19,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 08:55:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-25 08:55:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-11-25 08:55:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 08:55:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-11-25 08:55:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:55:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-11-25 08:55:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:55:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:55:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-11-25 08:55:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 08:55:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 08:55:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-25 08:55:19,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-25 08:55:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-25 08:55:20,068 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:20,068 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 08:55:20,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:20 BoogieIcfgContainer [2019-11-25 08:55:20,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:20,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:20,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:20,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:20,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:19" (1/3) ... [2019-11-25 08:55:20,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fcff81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:20, skipping insertion in model container [2019-11-25 08:55:20,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:19" (2/3) ... [2019-11-25 08:55:20,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fcff81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:20, skipping insertion in model container [2019-11-25 08:55:20,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:20" (3/3) ... [2019-11-25 08:55:20,080 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2019-11-25 08:55:20,087 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:20,093 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-25 08:55:20,103 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-25 08:55:20,121 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:20,121 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 08:55:20,121 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:20,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:20,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:20,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:20,122 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:20,122 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-25 08:55:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:55:20,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:20,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:20,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-11-25 08:55:20,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:20,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1208416973] [2019-11-25 08:55:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:20,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:55:20,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:20,508 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-11-25 08:55:20,510 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-25 08:55:20,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 91 [2019-11-25 08:55:20,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:20,627 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-25 08:55:20,629 INFO L567 ElimStorePlain]: treesize reduction 41, result has 53.4 percent of original size [2019-11-25 08:55:20,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:20,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:47 [2019-11-25 08:55:20,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:20,995 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:21,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1208416973] [2019-11-25 08:55:21,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:21,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:55:21,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206645338] [2019-11-25 08:55:21,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:21,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:21,103 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-25 08:55:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:21,281 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-25 08:55:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:21,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:55:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:21,290 INFO L225 Difference]: With dead ends: 69 [2019-11-25 08:55:21,290 INFO L226 Difference]: Without dead ends: 66 [2019-11-25 08:55:21,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-25 08:55:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-25 08:55:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:55:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-25 08:55:21,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2019-11-25 08:55:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-25 08:55:21,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-25 08:55:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:55:21,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:21,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:21,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:21,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-11-25 08:55:21,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:21,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1491410127] [2019-11-25 08:55:21,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:21,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:55:21,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:21,677 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 3=[|v_#valid_45|]} [2019-11-25 08:55:21,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:21,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:21,776 INFO L343 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2019-11-25 08:55:21,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2019-11-25 08:55:21,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:21,849 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-25 08:55:21,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2019-11-25 08:55:21,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:21,966 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-11-25 08:55:21,967 INFO L567 ElimStorePlain]: treesize reduction 45, result has 46.4 percent of original size [2019-11-25 08:55:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:21,971 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-11-25 08:55:21,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:39 [2019-11-25 08:55:21,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:22,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:22,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1491410127] [2019-11-25 08:55:22,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:22,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-25 08:55:22,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122542290] [2019-11-25 08:55:22,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:22,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:22,481 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-11-25 08:55:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:22,938 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-11-25 08:55:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:22,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-25 08:55:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:22,943 INFO L225 Difference]: With dead ends: 74 [2019-11-25 08:55:22,943 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:55:22,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:55:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-11-25 08:55:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 08:55:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-25 08:55:22,954 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 12 [2019-11-25 08:55:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:22,954 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-25 08:55:22,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-25 08:55:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:55:22,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:22,956 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:23,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:23,158 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 1 times [2019-11-25 08:55:23,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:23,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [892621717] [2019-11-25 08:55:23,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:23,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:55:23,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:23,327 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_53|]} [2019-11-25 08:55:23,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:23,433 INFO L343 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2019-11-25 08:55:23,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2019-11-25 08:55:23,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:23,503 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-25 08:55:23,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-11-25 08:55:23,514 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:23,599 INFO L567 ElimStorePlain]: treesize reduction 31, result has 55.7 percent of original size [2019-11-25 08:55:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,602 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-11-25 08:55:23,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:39 [2019-11-25 08:55:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:23,916 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:24,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892621717] [2019-11-25 08:55:24,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:24,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-25 08:55:24,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253343614] [2019-11-25 08:55:24,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:55:24,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:55:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:55:24,656 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 11 states. [2019-11-25 08:55:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:25,834 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-11-25 08:55:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:25,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-25 08:55:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:25,837 INFO L225 Difference]: With dead ends: 92 [2019-11-25 08:55:25,837 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:55:25,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:55:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-11-25 08:55:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-25 08:55:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-11-25 08:55:25,847 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 18 [2019-11-25 08:55:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:25,847 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-11-25 08:55:25,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:55:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-11-25 08:55:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:55:25,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:25,849 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:26,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:26,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash -16477363, now seen corresponding path program 1 times [2019-11-25 08:55:26,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:26,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1641279490] [2019-11-25 08:55:26,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:26,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:55:26,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:26,237 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:26,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1641279490] [2019-11-25 08:55:26,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:26,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 08:55:26,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192859314] [2019-11-25 08:55:26,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:26,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:26,355 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 10 states. [2019-11-25 08:55:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:26,639 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-25 08:55:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:55:26,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-25 08:55:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:26,652 INFO L225 Difference]: With dead ends: 89 [2019-11-25 08:55:26,652 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 08:55:26,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:55:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 08:55:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-11-25 08:55:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 08:55:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-11-25 08:55:26,666 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 26 [2019-11-25 08:55:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:26,667 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-11-25 08:55:26,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-11-25 08:55:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:55:26,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:26,669 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:26,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:26,872 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1091042873, now seen corresponding path program 2 times [2019-11-25 08:55:26,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:26,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534885800] [2019-11-25 08:55:26,873 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:27,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:55:27,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:27,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:55:27,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:27,101 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 8=[|v_#valid_64|]} [2019-11-25 08:55:27,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:27,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:27,144 INFO L377 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 35 [2019-11-25 08:55:27,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:27,197 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.5 percent of original size [2019-11-25 08:55:27,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:27,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2019-11-25 08:55:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:27,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:27,398 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2019-11-25 08:55:27,398 INFO L567 ElimStorePlain]: treesize reduction 293, result has 12.0 percent of original size [2019-11-25 08:55:27,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:27,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:31 [2019-11-25 08:55:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:27,802 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:29,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534885800] [2019-11-25 08:55:29,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:29,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-25 08:55:29,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086750256] [2019-11-25 08:55:29,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:55:29,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:55:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:55:29,055 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 18 states. [2019-11-25 08:55:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:30,752 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-25 08:55:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:55:30,757 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-25 08:55:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:30,758 INFO L225 Difference]: With dead ends: 101 [2019-11-25 08:55:30,758 INFO L226 Difference]: Without dead ends: 101 [2019-11-25 08:55:30,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:55:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-25 08:55:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-11-25 08:55:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-25 08:55:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-11-25 08:55:30,768 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 30 [2019-11-25 08:55:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:30,768 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-11-25 08:55:30,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:55:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-11-25 08:55:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 08:55:30,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,770 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:30,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:30,981 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash 277853620, now seen corresponding path program 2 times [2019-11-25 08:55:30,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:30,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2091809691] [2019-11-25 08:55:30,982 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:31,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 08:55:31,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:31,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:55:31,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:31,203 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-11-25 08:55:31,203 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-25 08:55:31,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 78 [2019-11-25 08:55:31,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:31,264 INFO L567 ElimStorePlain]: treesize reduction 28, result has 62.7 percent of original size [2019-11-25 08:55:31,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:31,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:47 [2019-11-25 08:55:31,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:31,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 08:55:32,006 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 08:55:32,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2091809691] [2019-11-25 08:55:32,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 08:55:32,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019966292] [2019-11-25 08:55:32,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:32,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:32,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:32,145 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 10 states. [2019-11-25 08:55:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,639 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-25 08:55:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:55:32,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-25 08:55:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,641 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:55:32,641 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 08:55:32,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 33 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 08:55:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-25 08:55:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 08:55:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-11-25 08:55:32,648 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 41 [2019-11-25 08:55:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,649 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-11-25 08:55:32,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-11-25 08:55:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 08:55:32,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,650 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:32,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 277853621, now seen corresponding path program 1 times [2019-11-25 08:55:32,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:32,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1834301147] [2019-11-25 08:55:32,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:55:33,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:33,146 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:33,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1834301147] [2019-11-25 08:55:33,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:33,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-25 08:55:33,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164906875] [2019-11-25 08:55:33,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-25 08:55:33,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-25 08:55:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:55:33,444 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 20 states. [2019-11-25 08:55:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,698 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-11-25 08:55:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:55:33,700 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-25 08:55:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,701 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:55:33,701 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 08:55:33,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:55:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 08:55:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-25 08:55:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 08:55:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-11-25 08:55:33,707 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 41 [2019-11-25 08:55:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,708 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2019-11-25 08:55:33,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-25 08:55:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2019-11-25 08:55:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-25 08:55:33,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,709 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:33,913 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash 545390343, now seen corresponding path program 3 times [2019-11-25 08:55:33,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:33,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1481251842] [2019-11-25 08:55:33,913 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:34,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-25 08:55:34,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:34,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 08:55:34,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:34,291 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_72|], 8=[|v_#valid_83|]} [2019-11-25 08:55:34,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:34,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:34,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:34,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:34,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:34,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:34,316 INFO L377 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 35 [2019-11-25 08:55:34,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:34,371 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.5 percent of original size [2019-11-25 08:55:34,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:34,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2019-11-25 08:55:34,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:55:34,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-25 08:55:34,504 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-11-25 08:55:34,504 INFO L567 ElimStorePlain]: treesize reduction 139, result has 22.3 percent of original size [2019-11-25 08:55:34,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:34,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:31 [2019-11-25 08:55:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:35,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:35,843 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-25 08:55:37,174 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-25 08:55:38,208 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-25 08:55:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:39,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481251842] [2019-11-25 08:55:39,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:39,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2019-11-25 08:55:39,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022646441] [2019-11-25 08:55:39,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-25 08:55:39,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-25 08:55:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-11-25 08:55:39,081 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 29 states. [2019-11-25 08:55:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:41,981 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-11-25 08:55:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:55:41,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-11-25 08:55:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:41,983 INFO L225 Difference]: With dead ends: 92 [2019-11-25 08:55:41,984 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:55:41,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-11-25 08:55:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:55:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-25 08:55:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 08:55:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-11-25 08:55:41,995 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 42 [2019-11-25 08:55:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:41,997 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-11-25 08:55:41,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-25 08:55:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-11-25 08:55:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 08:55:42,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:42,001 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:42,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:42,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash -554526955, now seen corresponding path program 2 times [2019-11-25 08:55:42,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:42,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1153791770] [2019-11-25 08:55:42,213 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:42,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 08:55:42,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:55:42,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:55:42,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:42,322 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_78|], 3=[|v_#valid_89|]} [2019-11-25 08:55:42,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:42,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:42,385 INFO L343 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2019-11-25 08:55:42,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2019-11-25 08:55:42,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:42,430 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-25 08:55:42,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2019-11-25 08:55:42,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 08:55:42,494 INFO L567 ElimStorePlain]: treesize reduction 18, result has 68.4 percent of original size [2019-11-25 08:55:42,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,496 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-11-25 08:55:42,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:39 [2019-11-25 08:55:42,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:42,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 08:55:43,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 08:55:43,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1153791770] [2019-11-25 08:55:43,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:43,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 08:55:43,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951132154] [2019-11-25 08:55:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:43,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:43,536 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 10 states. [2019-11-25 08:55:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:44,630 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-11-25 08:55:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:44,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-25 08:55:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:44,633 INFO L225 Difference]: With dead ends: 104 [2019-11-25 08:55:44,633 INFO L226 Difference]: Without dead ends: 104 [2019-11-25 08:55:44,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 40 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:55:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-25 08:55:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2019-11-25 08:55:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-25 08:55:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-11-25 08:55:44,641 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 47 [2019-11-25 08:55:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:44,642 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-11-25 08:55:44,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-11-25 08:55:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:55:44,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:44,644 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:44,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:44,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash -10466397, now seen corresponding path program 1 times [2019-11-25 08:55:44,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:44,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [319230285] [2019-11-25 08:55:44,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:45,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:55:45,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:45,182 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-25 08:55:45,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-11-25 08:55:45,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:45,221 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-11-25 08:55:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:45,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:45,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:39 [2019-11-25 08:55:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 08:55:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 08:55:45,254 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-25 08:55:45,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [319230285] [2019-11-25 08:55:45,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:45,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-25 08:55:45,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651727281] [2019-11-25 08:55:45,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:45,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:45,311 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2019-11-25 08:55:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:45,463 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-11-25 08:55:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:45,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-25 08:55:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:45,465 INFO L225 Difference]: With dead ends: 98 [2019-11-25 08:55:45,465 INFO L226 Difference]: Without dead ends: 98 [2019-11-25 08:55:45,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-25 08:55:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-25 08:55:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 08:55:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-25 08:55:45,469 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 48 [2019-11-25 08:55:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:45,470 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-25 08:55:45,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-25 08:55:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:55:45,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:45,471 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:45,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:45,684 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash -10466396, now seen corresponding path program 1 times [2019-11-25 08:55:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:45,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1173176957] [2019-11-25 08:55:45,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:45,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:55:45,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:45,991 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_91|], 4=[|v_#valid_107|]} [2019-11-25 08:55:45,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:46,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:46,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:55:46,040 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-25 08:55:46,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 38 [2019-11-25 08:55:46,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:46,093 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.8 percent of original size [2019-11-25 08:55:46,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2019-11-25 08:55:46,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:55:46,190 INFO L567 ElimStorePlain]: treesize reduction 95, result has 29.1 percent of original size [2019-11-25 08:55:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,191 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-11-25 08:55:46,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:39 [2019-11-25 08:55:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 08:55:46,675 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 08:55:46,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173176957] [2019-11-25 08:55:46,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:46,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-25 08:55:46,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518677544] [2019-11-25 08:55:46,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:46,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:55:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:46,924 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 6 states. [2019-11-25 08:55:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:47,301 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2019-11-25 08:55:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:47,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-25 08:55:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:47,303 INFO L225 Difference]: With dead ends: 102 [2019-11-25 08:55:47,303 INFO L226 Difference]: Without dead ends: 102 [2019-11-25 08:55:47,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 42 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-25 08:55:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-11-25 08:55:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-25 08:55:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-11-25 08:55:47,307 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 48 [2019-11-25 08:55:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:47,307 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-11-25 08:55:47,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-11-25 08:55:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:55:47,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:47,309 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:47,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:47,509 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-25 08:55:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash 831186517, now seen corresponding path program 1 times [2019-11-25 08:55:47,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:55:47,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1629212206] [2019-11-25 08:55:47,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb8e771d-2bc5-49b5-91fd-5234c7529ad3/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:47,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:55:47,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:55:48,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:55:49,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:55:49,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-11-25 08:55:49,499 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:49,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-11-25 08:55:49,508 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:49,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-11-25 08:55:49,527 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:49,647 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-25 08:55:49,648 INFO L567 ElimStorePlain]: treesize reduction 6, result has 89.5 percent of original size [2019-11-25 08:55:49,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-25 08:55:49,648 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-25 08:55:50,501 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-25 08:55:52,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-11-25 08:55:52,954 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:55:53,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:55:53,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:55:53,254 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_14 (_ BitVec 32))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse1 (bvmul getNumbers_~i~0 (_ bv4 32))) (.cse0 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvadd |~#array~0.offset| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (bvsle .cse0 v_arrayElimCell_14) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_14)) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_14)) (and (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11) (bvsle .cse2 v_arrayElimCell_11) (not (bvsle .cse0 v_arrayElimCell_11))) (not (bvsle .cse2 v_arrayElimCell_14)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:55:53,257 INFO L168 Benchmark]: Toolchain (without parser) took 34207.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -83.6 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:53,257 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:53,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:53,258 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:53,258 INFO L168 Benchmark]: RCFGBuilder took 583.62 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:53,259 INFO L168 Benchmark]: TraceAbstraction took 33186.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.6 MB). Peak memory consumption was 149.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:53,260 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 583.62 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33186.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.6 MB). Peak memory consumption was 149.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_14 (_ BitVec 32))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse1 (bvmul getNumbers_~i~0 (_ bv4 32))) (.cse0 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvadd |~#array~0.offset| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (bvsle .cse0 v_arrayElimCell_14) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_14)) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_14)) (and (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11) (bvsle .cse2 v_arrayElimCell_11) (not (bvsle .cse0 v_arrayElimCell_11))) (not (bvsle .cse2 v_arrayElimCell_14)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_14 (_ BitVec 32))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse1 (bvmul getNumbers_~i~0 (_ bv4 32))) (.cse0 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvadd |~#array~0.offset| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (bvsle .cse0 v_arrayElimCell_14) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_14)) (not (bvsle (bvadd .cse1 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_14)) (and (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11) (bvsle .cse2 v_arrayElimCell_11) (not (bvsle .cse0 v_arrayElimCell_11))) (not (bvsle .cse2 v_arrayElimCell_14)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...