./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:22,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:22,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:22,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:22,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:22,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:22,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:22,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:22,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:22,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:22,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:22,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:22,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:22,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:22,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:22,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:22,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:22,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:22,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:22,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:22,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:22,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:22,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:22,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:22,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:22,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:22,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:22,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:22,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:22,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:22,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:22,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:22,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:22,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:22,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:22,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:22,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:22,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:22,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:22,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:22,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:22,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-10-22 09:01:22,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:22,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:22,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:22,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:22,957 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:22,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:22,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 09:01:22,958 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 09:01:22,959 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 09:01:22,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:22,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:22,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:22,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:22,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:22,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:22,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:22,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:22,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:22,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:22,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:22,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:22,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2019-10-22 09:01:22,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:23,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:23,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:23,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:23,009 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:23,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-10-22 09:01:23,056 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/data/49ea2e1d7/f2a97a1b5ba44aab8d7c67dae056b830/FLAG7dd2d3242 [2019-10-22 09:01:23,411 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:23,412 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-10-22 09:01:23,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/data/49ea2e1d7/f2a97a1b5ba44aab8d7c67dae056b830/FLAG7dd2d3242 [2019-10-22 09:01:23,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/data/49ea2e1d7/f2a97a1b5ba44aab8d7c67dae056b830 [2019-10-22 09:01:23,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:23,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-10-22 09:01:23,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:23,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:23,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:23,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575c9bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23, skipping insertion in model container [2019-10-22 09:01:23,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,453 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:23,469 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:23,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:23,684 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:23,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:23,712 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:23,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23 WrapperNode [2019-10-22 09:01:23,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:23,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:23,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:23,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:23,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... [2019-10-22 09:01:23,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:23,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:23,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:23,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:23,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:23,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-10-22 09:01:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-22 09:01:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-22 09:01:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-10-22 09:01:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-10-22 09:01:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:24,148 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:24,149 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:01:24,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:24 BoogieIcfgContainer [2019-10-22 09:01:24,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:24,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:24,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:24,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:23" (1/3) ... [2019-10-22 09:01:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ba36f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:24, skipping insertion in model container [2019-10-22 09:01:24,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:23" (2/3) ... [2019-10-22 09:01:24,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ba36f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:24, skipping insertion in model container [2019-10-22 09:01:24,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:24" (3/3) ... [2019-10-22 09:01:24,157 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2019-10-22 09:01:24,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:24,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-22 09:01:24,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-22 09:01:24,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:24,195 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 09:01:24,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:24,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:24,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:24,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:24,195 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:24,195 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-10-22 09:01:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:24,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-10-22 09:01:24,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131294387] [2019-10-22 09:01:24,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:24,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131294387] [2019-10-22 09:01:24,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851084904] [2019-10-22 09:01:24,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:24,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:24,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:24,524 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-10-22 09:01:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,898 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-10-22 09:01:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:24,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:01:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,910 INFO L225 Difference]: With dead ends: 117 [2019-10-22 09:01:24,910 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 09:01:24,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 09:01:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-10-22 09:01:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 09:01:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-22 09:01:24,944 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-10-22 09:01:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-22 09:01:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-22 09:01:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:01:24,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-10-22 09:01:24,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269732010] [2019-10-22 09:01:24,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:25,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269732010] [2019-10-22 09:01:25,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994372169] [2019-10-22 09:01:25,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:25,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:25,136 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-10-22 09:01:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,391 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-10-22 09:01:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:25,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 09:01:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,392 INFO L225 Difference]: With dead ends: 66 [2019-10-22 09:01:25,392 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 09:01:25,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 09:01:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-22 09:01:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 09:01:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-22 09:01:25,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-10-22 09:01:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,400 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-22 09:01:25,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-22 09:01:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 09:01:25,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,401 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,402 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-10-22 09:01:25,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685293446] [2019-10-22 09:01:25,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:25,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685293446] [2019-10-22 09:01:25,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607584640] [2019-10-22 09:01:25,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:01:25,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:25,687 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 20=[|v_#valid_29|]} [2019-10-22 09:01:25,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:25,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:25,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:25,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:25,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:25,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 296 treesize of output 296 [2019-10-22 09:01:25,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:25,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:26,150 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 36 [2019-10-22 09:01:26,150 INFO L567 ElimStorePlain]: treesize reduction 4363, result has 1.2 percent of original size [2019-10-22 09:01:26,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:26,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:26,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:26,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-10-22 09:01:26,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985618321] [2019-10-22 09:01:26,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 09:01:26,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:26,268 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2019-10-22 09:01:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,631 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-22 09:01:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:26,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-10-22 09:01:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,633 INFO L225 Difference]: With dead ends: 69 [2019-10-22 09:01:26,633 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 09:01:26,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:01:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 09:01:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-22 09:01:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 09:01:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-22 09:01:26,638 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-10-22 09:01:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,639 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-22 09:01:26,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 09:01:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-22 09:01:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 09:01:26,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,639 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:26,840 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-10-22 09:01:26,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41167455] [2019-10-22 09:01:26,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:27,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41167455] [2019-10-22 09:01:27,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:27,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217825316] [2019-10-22 09:01:27,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 09:01:27,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:27,044 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 9 states. [2019-10-22 09:01:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,245 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-22 09:01:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:27,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-10-22 09:01:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,246 INFO L225 Difference]: With dead ends: 68 [2019-10-22 09:01:27,246 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 09:01:27,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 09:01:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-22 09:01:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 09:01:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-22 09:01:27,250 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2019-10-22 09:01:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,250 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-22 09:01:27,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 09:01:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-22 09:01:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:27,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,251 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:27,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2019-10-22 09:01:27,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983804121] [2019-10-22 09:01:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:01:27,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983804121] [2019-10-22 09:01:27,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:27,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80235076] [2019-10-22 09:01:27,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:27,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:27,342 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2019-10-22 09:01:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,579 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-22 09:01:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:27,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-22 09:01:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,580 INFO L225 Difference]: With dead ends: 65 [2019-10-22 09:01:27,580 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 09:01:27,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 09:01:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-22 09:01:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 09:01:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-22 09:01:27,597 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2019-10-22 09:01:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,598 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-22 09:01:27,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-22 09:01:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:27,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,598 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:27,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2019-10-22 09:01:27,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039085661] [2019-10-22 09:01:27,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:27,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039085661] [2019-10-22 09:01:27,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472792386] [2019-10-22 09:01:27,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:27,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:27,772 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:27,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-10-22 09:01:27,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841798015] [2019-10-22 09:01:27,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:01:27,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:01:27,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:27,774 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-10-22 09:01:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,040 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-22 09:01:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:28,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-10-22 09:01:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,041 INFO L225 Difference]: With dead ends: 70 [2019-10-22 09:01:28,041 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 09:01:28,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 09:01:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-10-22 09:01:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 09:01:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-22 09:01:28,046 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-10-22 09:01:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,046 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-22 09:01:28,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:01:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-22 09:01:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:01:28,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,047 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:28,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:28,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2019-10-22 09:01:28,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498118266] [2019-10-22 09:01:28,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:28,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498118266] [2019-10-22 09:01:28,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640384259] [2019-10-22 09:01:28,377 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:28,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:28,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:28,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 09:01:28,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:28,432 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 20=[|v_#valid_30|]} [2019-10-22 09:01:28,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:28,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:28,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:28,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:28,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:28,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 196 [2019-10-22 09:01:28,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:28,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:28,771 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 38 [2019-10-22 09:01:28,771 INFO L567 ElimStorePlain]: treesize reduction 1731, result has 3.2 percent of original size [2019-10-22 09:01:28,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:28,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 09:01:28,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:28,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2019-10-22 09:01:28,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566414724] [2019-10-22 09:01:28,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:28,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:01:28,997 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-10-22 09:01:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,273 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-22 09:01:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:29,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-22 09:01:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,274 INFO L225 Difference]: With dead ends: 68 [2019-10-22 09:01:29,274 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 09:01:29,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:01:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 09:01:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-22 09:01:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 09:01:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-22 09:01:29,283 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2019-10-22 09:01:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,283 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-22 09:01:29,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-22 09:01:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:01:29,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,284 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:29,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,485 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-10-22 09:01:29,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077077022] [2019-10-22 09:01:29,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:29,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077077022] [2019-10-22 09:01:29,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025150750] [2019-10-22 09:01:29,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:29,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:29,634 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:29,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-10-22 09:01:29,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026317076] [2019-10-22 09:01:29,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:29,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:29,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:29,635 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2019-10-22 09:01:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,781 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-22 09:01:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:29,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-22 09:01:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,782 INFO L225 Difference]: With dead ends: 73 [2019-10-22 09:01:29,782 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 09:01:29,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 09:01:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-10-22 09:01:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 09:01:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-22 09:01:29,787 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 27 [2019-10-22 09:01:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,787 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-22 09:01:29,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-22 09:01:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:01:29,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,788 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:29,989 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 2 times [2019-10-22 09:01:29,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338929267] [2019-10-22 09:01:29,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:30,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338929267] [2019-10-22 09:01:30,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973932874] [2019-10-22 09:01:30,099 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:30,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:30,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:30,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:01:30,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:30,316 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-10-22 09:01:30,316 INFO L341 Elim1Store]: treesize reduction 234, result has 29.9 percent of original size [2019-10-22 09:01:30,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 179 treesize of output 254 [2019-10-22 09:01:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:30,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:30,819 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 51 [2019-10-22 09:01:30,819 INFO L567 ElimStorePlain]: treesize reduction 9122, result has 1.0 percent of original size [2019-10-22 09:01:30,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:30,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:30,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-10-22 09:01:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:30,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:30,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:30,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:31,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:32,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:32,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-22 09:01:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 09:01:32,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:32,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-10-22 09:01:32,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447889278] [2019-10-22 09:01:32,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:32,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:32,256 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2019-10-22 09:01:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,282 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-22 09:01:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:32,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 09:01:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,283 INFO L225 Difference]: With dead ends: 70 [2019-10-22 09:01:32,283 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 09:01:32,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 27 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 09:01:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-22 09:01:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 09:01:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-22 09:01:32,291 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 30 [2019-10-22 09:01:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,292 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-22 09:01:32,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-22 09:01:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:01:32,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,292 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905532, now seen corresponding path program 1 times [2019-10-22 09:01:32,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384573279] [2019-10-22 09:01:32,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384573279] [2019-10-22 09:01:32,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625897865] [2019-10-22 09:01:32,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:32,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,633 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:32,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-10-22 09:01:32,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445486639] [2019-10-22 09:01:32,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 09:01:32,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:32,637 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 9 states. [2019-10-22 09:01:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,784 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-22 09:01:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:32,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-22 09:01:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,785 INFO L225 Difference]: With dead ends: 75 [2019-10-22 09:01:32,785 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 09:01:32,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 09:01:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-22 09:01:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 09:01:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-22 09:01:32,789 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2019-10-22 09:01:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,789 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-22 09:01:32,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 09:01:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-22 09:01:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 09:01:32,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,790 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,998 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 532455403, now seen corresponding path program 2 times [2019-10-22 09:01:32,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399211283] [2019-10-22 09:01:32,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:33,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399211283] [2019-10-22 09:01:33,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886785600] [2019-10-22 09:01:33,118 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:33,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:33,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,175 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 20=[|v_#valid_32|]} [2019-10-22 09:01:33,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:33,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:33,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:33,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:33,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:33,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 141 [2019-10-22 09:01:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:33,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:33,447 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 37 [2019-10-22 09:01:33,447 INFO L567 ElimStorePlain]: treesize reduction 807, result has 6.5 percent of original size [2019-10-22 09:01:33,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:33,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:01:33,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:33,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-10-22 09:01:33,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433659999] [2019-10-22 09:01:33,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:33,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:01:33,569 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2019-10-22 09:01:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,640 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-10-22 09:01:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:33,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-22 09:01:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,641 INFO L225 Difference]: With dead ends: 72 [2019-10-22 09:01:33,641 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 09:01:33,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:01:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 09:01:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-22 09:01:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 09:01:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-22 09:01:33,645 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 33 [2019-10-22 09:01:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-22 09:01:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-22 09:01:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 09:01:33,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,646 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:33,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1031100925, now seen corresponding path program 1 times [2019-10-22 09:01:33,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812492473] [2019-10-22 09:01:33,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:01:33,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812492473] [2019-10-22 09:01:33,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056347260] [2019-10-22 09:01:33,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:34,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:34,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-22 09:01:34,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321619054] [2019-10-22 09:01:34,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:01:34,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:01:34,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:34,095 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 14 states. [2019-10-22 09:01:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,333 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-10-22 09:01:34,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:01:34,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-10-22 09:01:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,336 INFO L225 Difference]: With dead ends: 92 [2019-10-22 09:01:34,337 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 09:01:34,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 09:01:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2019-10-22 09:01:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:01:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-10-22 09:01:34,340 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 42 [2019-10-22 09:01:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,341 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-10-22 09:01:34,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:01:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-10-22 09:01:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:01:34,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,342 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:34,543 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402646, now seen corresponding path program 2 times [2019-10-22 09:01:34,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122747848] [2019-10-22 09:01:34,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-22 09:01:34,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122747848] [2019-10-22 09:01:34,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:34,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226430089] [2019-10-22 09:01:34,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:34,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:34,641 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 8 states. [2019-10-22 09:01:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,848 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-10-22 09:01:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:34,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-22 09:01:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,849 INFO L225 Difference]: With dead ends: 81 [2019-10-22 09:01:34,850 INFO L226 Difference]: Without dead ends: 81 [2019-10-22 09:01:34,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-22 09:01:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-22 09:01:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 09:01:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-10-22 09:01:34,853 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2019-10-22 09:01:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,853 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-10-22 09:01:34,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-10-22 09:01:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:01:34,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,854 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402647, now seen corresponding path program 1 times [2019-10-22 09:01:34,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453553092] [2019-10-22 09:01:34,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:35,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453553092] [2019-10-22 09:01:35,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545778540] [2019-10-22 09:01:35,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:01:35,090 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:35,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2019-10-22 09:01:35,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2826292] [2019-10-22 09:01:35,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:01:35,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:01:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:35,092 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 14 states. [2019-10-22 09:01:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:35,278 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-10-22 09:01:35,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:35,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-10-22 09:01:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:35,279 INFO L225 Difference]: With dead ends: 84 [2019-10-22 09:01:35,279 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 09:01:35,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 09:01:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-22 09:01:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:01:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-10-22 09:01:35,282 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 50 [2019-10-22 09:01:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,283 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-10-22 09:01:35,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:01:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-10-22 09:01:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:01:35,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,284 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:35,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:35,485 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1417170302, now seen corresponding path program 2 times [2019-10-22 09:01:35,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726552092] [2019-10-22 09:01:35,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:35,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726552092] [2019-10-22 09:01:35,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682784831] [2019-10-22 09:01:35,744 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:35,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:35,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:35,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,784 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 20=[|v_#valid_33|]} [2019-10-22 09:01:35,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:35,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 202 [2019-10-22 09:01:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:36,041 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-10-22 09:01:36,041 INFO L567 ElimStorePlain]: treesize reduction 1661, result has 3.2 percent of original size [2019-10-22 09:01:36,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:36,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:01:36,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:36,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 23 [2019-10-22 09:01:36,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467432114] [2019-10-22 09:01:36,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:36,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-10-22 09:01:36,296 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 7 states. [2019-10-22 09:01:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,594 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-10-22 09:01:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:36,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 09:01:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,596 INFO L225 Difference]: With dead ends: 82 [2019-10-22 09:01:36,596 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 09:01:36,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-10-22 09:01:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 09:01:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-22 09:01:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:01:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-10-22 09:01:36,599 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 53 [2019-10-22 09:01:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,599 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-10-22 09:01:36,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-10-22 09:01:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:01:36,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,600 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:36,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:36,801 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash 982606402, now seen corresponding path program 1 times [2019-10-22 09:01:36,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999990881] [2019-10-22 09:01:36,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 09:01:36,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999990881] [2019-10-22 09:01:36,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:36,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645247953] [2019-10-22 09:01:36,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:36,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:36,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:36,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:36,890 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2019-10-22 09:01:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,029 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-10-22 09:01:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:37,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-22 09:01:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,031 INFO L225 Difference]: With dead ends: 81 [2019-10-22 09:01:37,031 INFO L226 Difference]: Without dead ends: 81 [2019-10-22 09:01:37,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-22 09:01:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-22 09:01:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 09:01:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-22 09:01:37,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 54 [2019-10-22 09:01:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,035 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-22 09:01:37,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-22 09:01:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:01:37,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,038 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:37,038 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash 982606403, now seen corresponding path program 1 times [2019-10-22 09:01:37,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:37,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727536348] [2019-10-22 09:01:37,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:37,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727536348] [2019-10-22 09:01:37,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202845438] [2019-10-22 09:01:37,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:01:37,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:01:37,287 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:37,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 15 [2019-10-22 09:01:37,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814283098] [2019-10-22 09:01:37,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 09:01:37,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:01:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:37,289 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 15 states. [2019-10-22 09:01:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,459 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-10-22 09:01:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:01:37,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-10-22 09:01:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,460 INFO L225 Difference]: With dead ends: 86 [2019-10-22 09:01:37,460 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 09:01:37,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:01:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 09:01:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-10-22 09:01:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:01:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-10-22 09:01:37,462 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 54 [2019-10-22 09:01:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,462 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-10-22 09:01:37,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 09:01:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-10-22 09:01:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 09:01:37,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,463 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:37,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:37,663 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1605941610, now seen corresponding path program 2 times [2019-10-22 09:01:37,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:37,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478775617] [2019-10-22 09:01:37,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:37,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478775617] [2019-10-22 09:01:37,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249643019] [2019-10-22 09:01:37,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:37,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:37,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:37,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:01:37,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:37,890 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 20=[|v_#valid_34|]} [2019-10-22 09:01:37,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:37,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:37,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:37,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:37,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:37,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 141 [2019-10-22 09:01:37,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:37,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:38,074 INFO L567 ElimStorePlain]: treesize reduction 363, result has 13.2 percent of original size [2019-10-22 09:01:38,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:38,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-22 09:01:38,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:38,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2019-10-22 09:01:38,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235133446] [2019-10-22 09:01:38,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:38,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:01:38,243 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 5 states. [2019-10-22 09:01:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,336 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-10-22 09:01:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:38,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-22 09:01:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,338 INFO L225 Difference]: With dead ends: 83 [2019-10-22 09:01:38,338 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 09:01:38,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:01:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 09:01:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-22 09:01:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 09:01:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-22 09:01:38,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 57 [2019-10-22 09:01:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,341 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-22 09:01:38,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-22 09:01:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:38,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,342 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:38,543 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -770751078, now seen corresponding path program 1 times [2019-10-22 09:01:38,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686778537] [2019-10-22 09:01:38,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-22 09:01:38,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686778537] [2019-10-22 09:01:38,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973910509] [2019-10-22 09:01:38,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:01:38,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 09:01:38,809 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:38,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-10-22 09:01:38,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738550611] [2019-10-22 09:01:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 09:01:38,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 09:01:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:01:38,811 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-10-22 09:01:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:39,018 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-10-22 09:01:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:01:39,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-10-22 09:01:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:39,019 INFO L225 Difference]: With dead ends: 103 [2019-10-22 09:01:39,019 INFO L226 Difference]: Without dead ends: 103 [2019-10-22 09:01:39,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:01:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-22 09:01:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-10-22 09:01:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:01:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-10-22 09:01:39,022 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 66 [2019-10-22 09:01:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,022 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-10-22 09:01:39,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 09:01:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-10-22 09:01:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-22 09:01:39,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,023 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:39,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104361, now seen corresponding path program 2 times [2019-10-22 09:01:39,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616081430] [2019-10-22 09:01:39,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-22 09:01:39,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616081430] [2019-10-22 09:01:39,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:39,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:39,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352896934] [2019-10-22 09:01:39,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:39,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:39,335 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 8 states. [2019-10-22 09:01:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:39,540 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-10-22 09:01:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:39,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-10-22 09:01:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:39,541 INFO L225 Difference]: With dead ends: 92 [2019-10-22 09:01:39,541 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 09:01:39,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 09:01:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-10-22 09:01:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 09:01:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-10-22 09:01:39,544 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 74 [2019-10-22 09:01:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,544 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-10-22 09:01:39,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-10-22 09:01:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-22 09:01:39,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,545 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,545 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104362, now seen corresponding path program 1 times [2019-10-22 09:01:39,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001379924] [2019-10-22 09:01:39,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:39,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001379924] [2019-10-22 09:01:39,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035829760] [2019-10-22 09:01:39,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:01:39,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 09:01:39,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:39,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 20 [2019-10-22 09:01:39,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176577581] [2019-10-22 09:01:39,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:01:39,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:01:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:01:39,851 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 20 states. [2019-10-22 09:01:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,101 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-10-22 09:01:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:01:40,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2019-10-22 09:01:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,102 INFO L225 Difference]: With dead ends: 97 [2019-10-22 09:01:40,102 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 09:01:40,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-22 09:01:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 09:01:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-10-22 09:01:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:01:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-22 09:01:40,105 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 74 [2019-10-22 09:01:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,105 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-22 09:01:40,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:01:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-22 09:01:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 09:01:40,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,106 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,307 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1142727185, now seen corresponding path program 2 times [2019-10-22 09:01:40,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576857180] [2019-10-22 09:01:40,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:01:40,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576857180] [2019-10-22 09:01:40,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053380945] [2019-10-22 09:01:40,507 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:40,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:40,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 09:01:40,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:40,569 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 20=[|v_#valid_35|]} [2019-10-22 09:01:40,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:40,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 136 [2019-10-22 09:01:40,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,752 INFO L567 ElimStorePlain]: treesize reduction 810, result has 6.5 percent of original size [2019-10-22 09:01:40,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:40,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-10-22 09:01:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-10-22 09:01:41,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:41,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2019-10-22 09:01:41,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38934343] [2019-10-22 09:01:41,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:41,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:41,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:41,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:01:41,006 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 7 states. [2019-10-22 09:01:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:41,214 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-10-22 09:01:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:41,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-10-22 09:01:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:41,217 INFO L225 Difference]: With dead ends: 93 [2019-10-22 09:01:41,217 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 09:01:41,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-22 09:01:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 09:01:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-10-22 09:01:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:01:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-22 09:01:41,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2019-10-22 09:01:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-22 09:01:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-22 09:01:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:01:41,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,220 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:41,421 INFO L410 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804319, now seen corresponding path program 1 times [2019-10-22 09:01:41,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073905882] [2019-10-22 09:01:41,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-10-22 09:01:41,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073905882] [2019-10-22 09:01:41,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:41,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:41,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965450616] [2019-10-22 09:01:41,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:41,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:41,532 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 5 states. [2019-10-22 09:01:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:41,659 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-10-22 09:01:41,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:41,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-22 09:01:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:41,659 INFO L225 Difference]: With dead ends: 92 [2019-10-22 09:01:41,659 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 09:01:41,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 09:01:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-22 09:01:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 09:01:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-10-22 09:01:41,662 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 78 [2019-10-22 09:01:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,662 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-10-22 09:01:41,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-10-22 09:01:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:01:41,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,664 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,664 INFO L410 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804320, now seen corresponding path program 1 times [2019-10-22 09:01:41,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261365457] [2019-10-22 09:01:41,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:01:41,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261365457] [2019-10-22 09:01:41,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315709503] [2019-10-22 09:01:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:41,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-22 09:01:41,902 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:41,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 10 [2019-10-22 09:01:41,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340935477] [2019-10-22 09:01:41,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:01:41,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:41,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:01:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:41,903 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 10 states. [2019-10-22 09:01:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,024 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-10-22 09:01:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:42,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-22 09:01:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,025 INFO L225 Difference]: With dead ends: 101 [2019-10-22 09:01:42,025 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 09:01:42,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 09:01:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-22 09:01:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-22 09:01:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-10-22 09:01:42,028 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 78 [2019-10-22 09:01:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,028 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-10-22 09:01:42,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:01:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-10-22 09:01:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:01:42,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,029 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:42,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:42,230 INFO L410 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash 233941358, now seen corresponding path program 2 times [2019-10-22 09:01:42,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446929325] [2019-10-22 09:01:42,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:01:42,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446929325] [2019-10-22 09:01:42,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413199702] [2019-10-22 09:01:42,456 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:42,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:42,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:42,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:01:42,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:42,513 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 13=[|v_#valid_36|]} [2019-10-22 09:01:42,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,551 INFO L341 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2019-10-22 09:01:42,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:42,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:42,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:42,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:42,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:42,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2019-10-22 09:01:42,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:42,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-22 09:01:42,650 INFO L567 ElimStorePlain]: treesize reduction 87, result has 33.1 percent of original size [2019-10-22 09:01:42,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:42,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-10-22 09:01:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-10-22 09:01:42,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:42,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2019-10-22 09:01:42,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398220824] [2019-10-22 09:01:42,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:42,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:01:42,895 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 5 states. [2019-10-22 09:01:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,975 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-10-22 09:01:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:42,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-22 09:01:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,976 INFO L225 Difference]: With dead ends: 96 [2019-10-22 09:01:42,976 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 09:01:42,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:01:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 09:01:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-22 09:01:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 09:01:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-10-22 09:01:42,979 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 83 [2019-10-22 09:01:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,979 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-10-22 09:01:42,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-10-22 09:01:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:42,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,980 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:43,181 INFO L410 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -951712836, now seen corresponding path program 1 times [2019-10-22 09:01:43,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431447135] [2019-10-22 09:01:43,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-10-22 09:01:43,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431447135] [2019-10-22 09:01:43,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783928788] [2019-10-22 09:01:43,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-22 09:01:43,453 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:43,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-22 09:01:43,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416210669] [2019-10-22 09:01:43,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 09:01:43,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:01:43,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:43,454 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 12 states. [2019-10-22 09:01:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,672 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-10-22 09:01:43,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:43,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-10-22 09:01:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,673 INFO L225 Difference]: With dead ends: 117 [2019-10-22 09:01:43,673 INFO L226 Difference]: Without dead ends: 117 [2019-10-22 09:01:43,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-22 09:01:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-22 09:01:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 09:01:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-10-22 09:01:43,676 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 92 [2019-10-22 09:01:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,676 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-10-22 09:01:43,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 09:01:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-10-22 09:01:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:01:43,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,677 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:43,878 INFO L410 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1776576828, now seen corresponding path program 2 times [2019-10-22 09:01:43,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927357344] [2019-10-22 09:01:43,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-22 09:01:44,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927357344] [2019-10-22 09:01:44,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:44,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472539023] [2019-10-22 09:01:44,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:44,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:44,015 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 8 states. [2019-10-22 09:01:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,225 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-10-22 09:01:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:44,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-10-22 09:01:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,226 INFO L225 Difference]: With dead ends: 107 [2019-10-22 09:01:44,226 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 09:01:44,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 09:01:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-10-22 09:01:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 09:01:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-22 09:01:44,229 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 102 [2019-10-22 09:01:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,229 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-22 09:01:44,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-22 09:01:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:01:44,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,230 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,230 INFO L410 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1776576829, now seen corresponding path program 1 times [2019-10-22 09:01:44,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092436952] [2019-10-22 09:01:44,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:01:44,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092436952] [2019-10-22 09:01:44,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105758116] [2019-10-22 09:01:44,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:44,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-10-22 09:01:44,584 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:44,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 15 [2019-10-22 09:01:44,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001520795] [2019-10-22 09:01:44,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 09:01:44,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:01:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:44,586 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 15 states. [2019-10-22 09:01:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,785 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-10-22 09:01:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:44,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2019-10-22 09:01:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,786 INFO L225 Difference]: With dead ends: 114 [2019-10-22 09:01:44,786 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 09:01:44,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 09:01:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-10-22 09:01:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 09:01:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2019-10-22 09:01:44,790 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 102 [2019-10-22 09:01:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,790 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2019-10-22 09:01:44,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 09:01:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2019-10-22 09:01:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-22 09:01:44,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,791 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:44,992 INFO L410 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-10-22 09:01:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash -270653237, now seen corresponding path program 2 times [2019-10-22 09:01:44,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043825145] [2019-10-22 09:01:44,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-22 09:01:45,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043825145] [2019-10-22 09:01:45,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123529945] [2019-10-22 09:01:45,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:45,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:45,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:45,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,466 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 13=[|v_#valid_37|]} [2019-10-22 09:01:45,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,504 INFO L341 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2019-10-22 09:01:45,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 26 [2019-10-22 09:01:45,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:45,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:45,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:45,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 100 [2019-10-22 09:01:45,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,608 INFO L567 ElimStorePlain]: treesize reduction 82, result has 33.3 percent of original size [2019-10-22 09:01:45,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:45,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-10-22 09:01:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-22 09:01:46,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:46,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2019-10-22 09:01:46,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214447652] [2019-10-22 09:01:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:46,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-10-22 09:01:46,016 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 7 states. [2019-10-22 09:01:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,215 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-10-22 09:01:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:46,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2019-10-22 09:01:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,215 INFO L225 Difference]: With dead ends: 110 [2019-10-22 09:01:46,215 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:46,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-10-22 09:01:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:46,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2019-10-22 09:01:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,217 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:46,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:46,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:46,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:46,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:46 BoogieIcfgContainer [2019-10-22 09:01:46,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:46,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:46,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:46,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:46,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:24" (3/4) ... [2019-10-22 09:01:46,427 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:46,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-10-22 09:01:46,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-10-22 09:01:46,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-10-22 09:01:46,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-10-22 09:01:46,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-10-22 09:01:46,436 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-10-22 09:01:46,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-10-22 09:01:46,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-10-22 09:01:46,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:46,442 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 09:01:46,493 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c72171df-5a95-4b16-b474-67ec8da78a79/bin/uautomizer/witness.graphml [2019-10-22 09:01:46,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:46,495 INFO L168 Benchmark]: Toolchain (without parser) took 23062.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 945.8 MB in the beginning and 951.1 MB in the end (delta: -5.3 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,495 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:46,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,496 INFO L168 Benchmark]: Boogie Preprocessor took 37.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,496 INFO L168 Benchmark]: RCFGBuilder took 399.71 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,496 INFO L168 Benchmark]: TraceAbstraction took 22270.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 122.1 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,497 INFO L168 Benchmark]: Witness Printer took 71.47 ms. Allocated memory is still 1.3 GB. Free memory was 963.7 MB in the beginning and 951.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:46,498 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.71 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22270.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 122.1 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.47 ms. Allocated memory is still 1.3 GB. Free memory was 963.7 MB in the beginning and 951.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. Result: SAFE, OverallTime: 22.2s, OverallIterations: 29, TraceHistogramMax: 10, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1339 SDtfs, 1245 SDslu, 5672 SDs, 0 SdLazy, 3795 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 1181 SyntacticMatches, 28 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 107 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2661 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2612 ConstructedInterpolants, 463 QuantifiedInterpolants, 1977801 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4246 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 2948/4138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...