./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-30f4e4a [2019-11-28 02:46:36,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:36,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:36,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:36,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:36,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:36,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:36,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:36,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:36,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:36,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:36,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:36,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:36,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:36,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:36,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:36,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:36,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:36,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:36,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:36,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:36,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:36,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:36,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:36,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:36,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:36,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:36,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:36,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:36,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:36,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:36,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:36,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:36,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:36,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:36,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:36,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:36,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:36,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:36,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:36,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:36,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:36,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:36,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:36,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:36,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:36,307 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:36,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:36,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:36,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:36,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:36,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:36,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:36,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:36,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:36,310 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:36,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:36,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:36,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:36,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:36,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:36,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:36,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:36,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:36,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:36,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:36,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:36,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:36,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:36,314 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 02:46:36,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:36,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:36,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:36,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:36,649 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:36,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-11-28 02:46:36,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421c9480/be64c65faba44061b79e3fa6e13dfa66/FLAGb6abbf4b6 [2019-11-28 02:46:37,199 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:37,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-11-28 02:46:37,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421c9480/be64c65faba44061b79e3fa6e13dfa66/FLAGb6abbf4b6 [2019-11-28 02:46:37,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a421c9480/be64c65faba44061b79e3fa6e13dfa66 [2019-11-28 02:46:37,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:37,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:37,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:37,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:37,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:37,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:37,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7f4e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37, skipping insertion in model container [2019-11-28 02:46:37,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:37,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:37,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:37,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:37,869 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:37,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:37,977 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:37,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37 WrapperNode [2019-11-28 02:46:37,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:37,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:37,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:37,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:37,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:37,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... [2019-11-28 02:46:38,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:38,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:38,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:38,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:38,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-11-28 02:46:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-11-28 02:46:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-11-28 02:46:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-11-28 02:46:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-28 02:46:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-11-28 02:46:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:46:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-11-28 02:46:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:46:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-11-28 02:46:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-11-28 02:46:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:46:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 02:46:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:46:38,537 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:38,537 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:46:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:38 BoogieIcfgContainer [2019-11-28 02:46:38,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:38,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:38,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:38,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:38,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:37" (1/3) ... [2019-11-28 02:46:38,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f98bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:38, skipping insertion in model container [2019-11-28 02:46:38,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:37" (2/3) ... [2019-11-28 02:46:38,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f98bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:38, skipping insertion in model container [2019-11-28 02:46:38,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:38" (3/3) ... [2019-11-28 02:46:38,551 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2019-11-28 02:46:38,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:38,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-28 02:46:38,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-28 02:46:38,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:38,596 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:38,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:38,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:38,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:38,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:38,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:38,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-28 02:46:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:38,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:38,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:38,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-11-28 02:46:38,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:38,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477892891] [2019-11-28 02:46:38,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:39,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477892891] [2019-11-28 02:46:39,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:39,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:46:39,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458436015] [2019-11-28 02:46:39,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:39,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:39,038 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-28 02:46:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:39,499 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-11-28 02:46:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:39,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:46:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:39,517 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:46:39,517 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:46:39,521 INFO L630 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-11-28 02:46:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:46:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-11-28 02:46:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:46:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-28 02:46:39,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-11-28 02:46:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:39,588 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-28 02:46:39,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-28 02:46:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:39,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:39,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:39,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-11-28 02:46:39,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:39,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190459374] [2019-11-28 02:46:39,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:39,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190459374] [2019-11-28 02:46:39,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:39,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:39,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556521907] [2019-11-28 02:46:39,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:39,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:39,886 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-11-28 02:46:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:40,212 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-28 02:46:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:40,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:46:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:40,215 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:46:40,215 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 02:46:40,218 INFO L630 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-11-28 02:46:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 02:46:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-28 02:46:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:46:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-28 02:46:40,238 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-11-28 02:46:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:40,239 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-28 02:46:40,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-28 02:46:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:46:40,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:40,242 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:40,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-11-28 02:46:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:40,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770075455] [2019-11-28 02:46:40,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770075455] [2019-11-28 02:46:40,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439449462] [2019-11-28 02:46:40,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:46:40,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:40,680 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_25|], 20=[|v_#valid_29|]} [2019-11-28 02:46:40,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,736 INFO L377 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-11-28 02:46:40,738 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:40,775 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:40,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:40,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:40,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 320 [2019-11-28 02:46:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:40,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:41,399 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:42,113 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 37 [2019-11-28 02:46:42,115 INFO L588 ElimStorePlain]: treesize reduction 20638, result has 0.3 percent of original size [2019-11-28 02:46:42,117 INFO L508 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-11-28 02:46:42,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-28 02:46:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:42,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:42,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-11-28 02:46:42,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88818166] [2019-11-28 02:46:42,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:42,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:42,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:42,266 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2019-11-28 02:46:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:42,747 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 02:46:42,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:42,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-28 02:46:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:42,748 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:46:42,748 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:46:42,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:46:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-28 02:46:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:46:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-28 02:46:42,755 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-11-28 02:46:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:42,756 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-28 02:46:42,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-28 02:46:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:42,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:42,757 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:42,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:42,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-11-28 02:46:42,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:42,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133852052] [2019-11-28 02:46:42,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:43,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133852052] [2019-11-28 02:46:43,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509437844] [2019-11-28 02:46:43,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:43,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:46:43,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:43,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:46:43,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:43,205 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_26|], 20=[|v_#valid_30|]} [2019-11-28 02:46:43,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,231 INFO L377 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-11-28 02:46:43,232 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:43,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:43,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:43,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:43,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 220 [2019-11-28 02:46:43,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:43,520 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:43,840 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 37 [2019-11-28 02:46:43,841 INFO L588 ElimStorePlain]: treesize reduction 10492, result has 0.5 percent of original size [2019-11-28 02:46:43,843 INFO L508 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-11-28 02:46:43,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-28 02:46:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:44,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:44,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2019-11-28 02:46:44,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476559826] [2019-11-28 02:46:44,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:44,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:44,069 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-11-28 02:46:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:44,224 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-28 02:46:44,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:44,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 02:46:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:44,225 INFO L225 Difference]: With dead ends: 68 [2019-11-28 02:46:44,226 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:46:44,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:46:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 02:46:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 02:46:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-28 02:46:44,242 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2019-11-28 02:46:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:44,245 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-28 02:46:44,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-28 02:46:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:44,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:44,246 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:44,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:44,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2019-11-28 02:46:44,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:44,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525766498] [2019-11-28 02:46:44,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:46:44,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525766498] [2019-11-28 02:46:44,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:44,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:46:44,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016943315] [2019-11-28 02:46:44,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:44,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:44,591 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2019-11-28 02:46:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:44,868 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 02:46:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:44,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:46:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:44,871 INFO L225 Difference]: With dead ends: 65 [2019-11-28 02:46:44,871 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:46:44,872 INFO L630 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-11-28 02:46:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:46:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 02:46:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:46:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-28 02:46:44,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2019-11-28 02:46:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:44,878 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-28 02:46:44,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-28 02:46:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:44,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:44,879 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:44,880 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2019-11-28 02:46:44,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:44,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709964261] [2019-11-28 02:46:44,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:45,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709964261] [2019-11-28 02:46:45,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064241821] [2019-11-28 02:46:45,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:46:45,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:45,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:45,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-28 02:46:45,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260848111] [2019-11-28 02:46:45,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:46:45,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:46:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:45,124 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-11-28 02:46:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:45,491 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-28 02:46:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:45,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 02:46:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:45,493 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:46:45,493 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 02:46:45,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:46:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 02:46:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-11-28 02:46:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:46:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-28 02:46:45,499 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-11-28 02:46:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:45,499 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-28 02:46:45,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:46:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-28 02:46:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:46:45,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:45,500 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:45,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:45,711 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2019-11-28 02:46:45,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:45,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328416044] [2019-11-28 02:46:45,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:45,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328416044] [2019-11-28 02:46:45,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214690888] [2019-11-28 02:46:45,910 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:45,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:45,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:45,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 02:46:45,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:45,999 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_27|], 20=[|v_#valid_31|]} [2019-11-28 02:46:46,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,020 INFO L377 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-11-28 02:46:46,020 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:46,049 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:46,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:46,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:46,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 165 [2019-11-28 02:46:46,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:46,225 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:46,610 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 37 [2019-11-28 02:46:46,611 INFO L588 ElimStorePlain]: treesize reduction 6507, result has 0.8 percent of original size [2019-11-28 02:46:46,612 INFO L508 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-11-28 02:46:46,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-28 02:46:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:46:46,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:46,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2019-11-28 02:46:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368592518] [2019-11-28 02:46:46,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:46,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:46:46,890 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-11-28 02:46:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:47,273 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-28 02:46:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:47,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 02:46:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:47,274 INFO L225 Difference]: With dead ends: 68 [2019-11-28 02:46:47,274 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:46:47,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:46:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:46:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 02:46:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:46:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-28 02:46:47,286 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2019-11-28 02:46:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:47,286 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-28 02:46:47,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-28 02:46:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:47,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:47,288 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:47,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:47,499 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-11-28 02:46:47,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:47,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136694481] [2019-11-28 02:46:47,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:46:47,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136694481] [2019-11-28 02:46:47,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:47,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:46:47,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967521096] [2019-11-28 02:46:47,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:47,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:47,587 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-11-28 02:46:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:47,808 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-28 02:46:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:47,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 02:46:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:47,809 INFO L225 Difference]: With dead ends: 67 [2019-11-28 02:46:47,809 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 02:46:47,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-28 02:46:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 02:46:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-28 02:46:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:46:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-28 02:46:47,823 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 27 [2019-11-28 02:46:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:47,825 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-28 02:46:47,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-28 02:46:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:47,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:47,828 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:47,828 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -510798197, now seen corresponding path program 1 times [2019-11-28 02:46:47,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:47,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386169476] [2019-11-28 02:46:47,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:47,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386169476] [2019-11-28 02:46:47,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483899280] [2019-11-28 02:46:47,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:48,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:46:48,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:48,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:48,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-28 02:46:48,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368427616] [2019-11-28 02:46:48,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:48,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:48,032 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 8 states. [2019-11-28 02:46:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:48,211 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-28 02:46:48,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:48,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-28 02:46:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:48,213 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:46:48,213 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 02:46:48,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 02:46:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-28 02:46:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 02:46:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-28 02:46:48,220 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2019-11-28 02:46:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:48,220 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-28 02:46:48,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-28 02:46:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:48,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:48,222 INFO L410 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-11-28 02:46:48,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:48,426 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905532, now seen corresponding path program 2 times [2019-11-28 02:46:48,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:48,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917525618] [2019-11-28 02:46:48,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:48,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917525618] [2019-11-28 02:46:48,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011738071] [2019-11-28 02:46:48,550 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:48,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:48,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:48,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:46:48,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:48,621 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_28|], 14=[|v_#valid_32|]} [2019-11-28 02:46:48,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:48,681 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-28 02:46:48,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 40 [2019-11-28 02:46:48,683 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:48,747 INFO L588 ElimStorePlain]: treesize reduction 10, result has 89.0 percent of original size [2019-11-28 02:46:48,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:48,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2019-11-28 02:46:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:48,817 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:49,008 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-11-28 02:46:49,009 INFO L588 ElimStorePlain]: treesize reduction 1299, result has 4.2 percent of original size [2019-11-28 02:46:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,011 INFO L508 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-11-28 02:46:49,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:70, output treesize:57 [2019-11-28 02:46:49,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:50,169 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 02:46:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 02:46:50,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:50,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 02:46:50,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704343430] [2019-11-28 02:46:50,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:50,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:50,313 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-11-28 02:46:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:50,501 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 02:46:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:50,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 02:46:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:50,503 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:46:50,503 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:46:50,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:46:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-28 02:46:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 02:46:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-28 02:46:50,508 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 30 [2019-11-28 02:46:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:50,508 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-28 02:46:50,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-28 02:46:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:46:50,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:50,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:50,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:50,713 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1515534916, now seen corresponding path program 1 times [2019-11-28 02:46:50,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:50,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676271092] [2019-11-28 02:46:50,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 02:46:50,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676271092] [2019-11-28 02:46:50,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570086351] [2019-11-28 02:46:50,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:50,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:46:50,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:46:50,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:50,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 02:46:50,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262726724] [2019-11-28 02:46:50,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:46:50,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:46:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:50,968 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 13 states. [2019-11-28 02:46:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:51,299 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-11-28 02:46:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:46:51,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-28 02:46:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:51,304 INFO L225 Difference]: With dead ends: 89 [2019-11-28 02:46:51,304 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 02:46:51,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 02:46:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-28 02:46:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:46:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-11-28 02:46:51,309 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 39 [2019-11-28 02:46:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:51,309 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-11-28 02:46:51,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:46:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-11-28 02:46:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:46:51,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:51,311 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-11-28 02:46:51,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:51,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 657191965, now seen corresponding path program 2 times [2019-11-28 02:46:51,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:51,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243606200] [2019-11-28 02:46:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 02:46:51,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243606200] [2019-11-28 02:46:51,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:51,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:46:51,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137946767] [2019-11-28 02:46:51,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:51,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:51,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:51,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:51,658 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2019-11-28 02:46:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:51,937 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-11-28 02:46:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:51,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-28 02:46:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:51,940 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:46:51,940 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:51,940 INFO L630 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-11-28 02:46:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-28 02:46:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:46:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-11-28 02:46:51,944 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 47 [2019-11-28 02:46:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:51,945 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-11-28 02:46:51,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-11-28 02:46:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:46:51,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:51,946 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-11-28 02:46:51,946 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash 657191966, now seen corresponding path program 1 times [2019-11-28 02:46:51,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:51,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366997913] [2019-11-28 02:46:51,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366997913] [2019-11-28 02:46:52,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335533223] [2019-11-28 02:46:52,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:46:52,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:46:52,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:52,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 13 [2019-11-28 02:46:52,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54866559] [2019-11-28 02:46:52,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:46:52,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:46:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:52,215 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 13 states. [2019-11-28 02:46:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,436 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-28 02:46:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:52,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-11-28 02:46:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,438 INFO L225 Difference]: With dead ends: 81 [2019-11-28 02:46:52,438 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 02:46:52,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 02:46:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-28 02:46:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:46:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-28 02:46:52,442 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 47 [2019-11-28 02:46:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,442 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-28 02:46:52,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:46:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-28 02:46:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 02:46:52,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,446 INFO L410 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-11-28 02:46:52,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:52,647 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402647, now seen corresponding path program 2 times [2019-11-28 02:46:52,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979483067] [2019-11-28 02:46:52,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979483067] [2019-11-28 02:46:52,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317941356] [2019-11-28 02:46:52,844 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:52,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:52,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:52,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:46:52,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:52,982 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-28 02:46:52,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-11-28 02:46:52,983 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,024 INFO L588 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-11-28 02:46:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:46:53,026 INFO L508 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-11-28 02:46:53,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-11-28 02:46:53,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:46:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-28 02:46:53,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:53,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2019-11-28 02:46:53,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16010931] [2019-11-28 02:46:53,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:53,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:46:53,137 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 7 states. [2019-11-28 02:46:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:53,295 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-11-28 02:46:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:53,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 02:46:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:53,297 INFO L225 Difference]: With dead ends: 79 [2019-11-28 02:46:53,297 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 02:46:53,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:46:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 02:46:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-28 02:46:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:46:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-28 02:46:53,300 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2019-11-28 02:46:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:53,300 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-28 02:46:53,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-28 02:46:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 02:46:53,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:53,302 INFO L410 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, 1] [2019-11-28 02:46:53,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:53,505 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash -856158199, now seen corresponding path program 1 times [2019-11-28 02:46:53,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:53,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382324673] [2019-11-28 02:46:53,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-28 02:46:53,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382324673] [2019-11-28 02:46:53,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:53,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:46:53,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886241148] [2019-11-28 02:46:53,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:53,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:53,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:53,615 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 5 states. [2019-11-28 02:46:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:53,799 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-28 02:46:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:53,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 02:46:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:53,801 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:46:53,802 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:53,802 INFO L630 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-11-28 02:46:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 02:46:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:46:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-28 02:46:53,811 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2019-11-28 02:46:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:53,811 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-28 02:46:53,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-28 02:46:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 02:46:53,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:53,817 INFO L410 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, 1] [2019-11-28 02:46:53,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -856158198, now seen corresponding path program 1 times [2019-11-28 02:46:53,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:53,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849834625] [2019-11-28 02:46:53,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-28 02:46:53,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849834625] [2019-11-28 02:46:53,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:53,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:46:53,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686939641] [2019-11-28 02:46:53,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:53,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:53,999 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2019-11-28 02:46:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:54,228 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-11-28 02:46:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:54,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-28 02:46:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:54,230 INFO L225 Difference]: With dead ends: 82 [2019-11-28 02:46:54,230 INFO L226 Difference]: Without dead ends: 82 [2019-11-28 02:46:54,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-28 02:46:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-11-28 02:46:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:46:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-11-28 02:46:54,234 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 51 [2019-11-28 02:46:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:54,234 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-11-28 02:46:54,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-11-28 02:46:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 02:46:54,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:54,235 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:54,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash -321031436, now seen corresponding path program 1 times [2019-11-28 02:46:54,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:54,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594139445] [2019-11-28 02:46:54,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:46:54,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594139445] [2019-11-28 02:46:54,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038528960] [2019-11-28 02:46:54,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:46:54,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 02:46:54,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:54,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2019-11-28 02:46:54,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243099551] [2019-11-28 02:46:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:46:54,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:46:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:54,533 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 14 states. [2019-11-28 02:46:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:54,787 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-28 02:46:54,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:54,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-11-28 02:46:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:54,789 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:46:54,790 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 02:46:54,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 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-11-28 02:46:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 02:46:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-11-28 02:46:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:46:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-11-28 02:46:54,796 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 56 [2019-11-28 02:46:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:54,796 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-11-28 02:46:54,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:46:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-11-28 02:46:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 02:46:54,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:54,798 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:55,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:55,003 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:46:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1703648347, now seen corresponding path program 2 times [2019-11-28 02:46:55,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496312077] [2019-11-28 02:46:55,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:55,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496312077] [2019-11-28 02:46:55,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209625711] [2019-11-28 02:46:55,446 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:46:55,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:55,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:55,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:46:55,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:55,503 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_30|], 15=[|v_#valid_33|]} [2019-11-28 02:46:55,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:46:55,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:55,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 40 [2019-11-28 02:46:55,530 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:55,591 INFO L588 ElimStorePlain]: treesize reduction 10, result has 89.7 percent of original size [2019-11-28 02:46:55,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:55,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 174 [2019-11-28 02:46:55,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,646 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:55,878 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-11-28 02:46:55,879 INFO L588 ElimStorePlain]: treesize reduction 1627, result has 3.6 percent of original size [2019-11-28 02:46:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,881 INFO L508 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-11-28 02:46:55,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:60 [2019-11-28 02:46:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:56,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:58,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-28 02:46:58,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:58,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 27 [2019-11-28 02:46:58,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5553617] [2019-11-28 02:46:58,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 02:46:58,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 02:46:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 02:46:58,454 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 27 states. [2019-11-28 02:46:58,727 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-28 02:46:58,935 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-11-28 02:47:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:00,536 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-28 02:47:00,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:47:00,538 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2019-11-28 02:47:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:00,539 INFO L225 Difference]: With dead ends: 87 [2019-11-28 02:47:00,539 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 02:47:00,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 11 SyntacticMatches, 45 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 02:47:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 02:47:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-28 02:47:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:47:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-11-28 02:47:00,543 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 59 [2019-11-28 02:47:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:00,543 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-11-28 02:47:00,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 02:47:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-11-28 02:47:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 02:47:00,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:00,544 INFO L410 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-11-28 02:47:00,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:00,747 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -770751078, now seen corresponding path program 1 times [2019-11-28 02:47:00,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:00,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636140415] [2019-11-28 02:47:00,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-28 02:47:00,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636140415] [2019-11-28 02:47:00,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668966507] [2019-11-28 02:47:00,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:47:00,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 02:47:01,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:01,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-11-28 02:47:01,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958590753] [2019-11-28 02:47:01,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:47:01,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:47:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:47:01,064 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-11-28 02:47:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:01,375 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-28 02:47:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:47:01,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-11-28 02:47:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:01,377 INFO L225 Difference]: With dead ends: 103 [2019-11-28 02:47:01,377 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 02:47:01,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:47:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 02:47:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-11-28 02:47:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:47:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-11-28 02:47:01,381 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 66 [2019-11-28 02:47:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:01,382 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-11-28 02:47:01,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:47:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-11-28 02:47:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 02:47:01,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:01,383 INFO L410 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-11-28 02:47:01,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:01,584 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104361, now seen corresponding path program 2 times [2019-11-28 02:47:01,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:01,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057038636] [2019-11-28 02:47:01,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-28 02:47:01,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057038636] [2019-11-28 02:47:01,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:01,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:01,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144839719] [2019-11-28 02:47:01,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:01,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:01,742 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 8 states. [2019-11-28 02:47:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:01,982 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-11-28 02:47:01,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:01,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-11-28 02:47:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:01,984 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:47:01,984 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 02:47:01,985 INFO L630 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-11-28 02:47:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 02:47:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-28 02:47:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:47:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-11-28 02:47:01,989 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 74 [2019-11-28 02:47:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:01,989 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-11-28 02:47:01,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-11-28 02:47:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 02:47:01,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:01,990 INFO L410 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-11-28 02:47:01,990 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104362, now seen corresponding path program 1 times [2019-11-28 02:47:01,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:01,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809264231] [2019-11-28 02:47:01,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809264231] [2019-11-28 02:47:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121518443] [2019-11-28 02:47:02,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:02,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:47:02,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:47:02,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:02,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 23 [2019-11-28 02:47:02,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096702350] [2019-11-28 02:47:02,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 02:47:02,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 02:47:02,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:47:02,480 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 23 states. [2019-11-28 02:47:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:03,340 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-11-28 02:47:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 02:47:03,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-11-28 02:47:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:03,342 INFO L225 Difference]: With dead ends: 97 [2019-11-28 02:47:03,342 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:47:03,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 02:47:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:47:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-28 02:47:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:47:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-11-28 02:47:03,348 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 74 [2019-11-28 02:47:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:03,348 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-11-28 02:47:03,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 02:47:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-11-28 02:47:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 02:47:03,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:03,349 INFO L410 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-11-28 02:47:03,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:03,551 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1142727185, now seen corresponding path program 2 times [2019-11-28 02:47:03,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:03,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063055184] [2019-11-28 02:47:03,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 02:47:03,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063055184] [2019-11-28 02:47:03,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480645074] [2019-11-28 02:47:03,782 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:03,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:03,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:03,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:47:03,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:03,990 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-11-28 02:47:03,991 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-28 02:47:03,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-11-28 02:47:03,992 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,041 INFO L588 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-11-28 02:47:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:04,044 INFO L508 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-11-28 02:47:04,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-11-28 02:47:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-28 02:47:04,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:04,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2019-11-28 02:47:04,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138189000] [2019-11-28 02:47:04,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:04,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:04,188 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 7 states. [2019-11-28 02:47:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:04,375 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-11-28 02:47:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:04,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-11-28 02:47:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:04,378 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:47:04,378 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:47:04,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:47:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:47:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-28 02:47:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:47:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-11-28 02:47:04,382 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2019-11-28 02:47:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:04,382 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-11-28 02:47:04,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-11-28 02:47:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 02:47:04,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:04,384 INFO L410 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-11-28 02:47:04,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:04,589 INFO L410 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804319, now seen corresponding path program 1 times [2019-11-28 02:47:04,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:04,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731329226] [2019-11-28 02:47:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-28 02:47:04,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731329226] [2019-11-28 02:47:04,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:04,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:04,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901276515] [2019-11-28 02:47:04,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:04,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:04,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:04,721 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 5 states. [2019-11-28 02:47:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:04,888 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-11-28 02:47:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:04,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-28 02:47:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:04,890 INFO L225 Difference]: With dead ends: 92 [2019-11-28 02:47:04,890 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 02:47:04,891 INFO L630 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-11-28 02:47:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 02:47:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-28 02:47:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 02:47:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-11-28 02:47:04,896 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 78 [2019-11-28 02:47:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:04,897 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-11-28 02:47:04,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-11-28 02:47:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 02:47:04,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:04,898 INFO L410 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-11-28 02:47:04,898 INFO L410 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:04,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804320, now seen corresponding path program 1 times [2019-11-28 02:47:04,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:04,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351318040] [2019-11-28 02:47:04,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 02:47:05,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351318040] [2019-11-28 02:47:05,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821243442] [2019-11-28 02:47:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:47:05,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-28 02:47:05,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:05,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 15 [2019-11-28 02:47:05,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538973068] [2019-11-28 02:47:05,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:47:05,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:47:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:47:05,422 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2019-11-28 02:47:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:05,866 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-28 02:47:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:05,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-11-28 02:47:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:05,868 INFO L225 Difference]: With dead ends: 103 [2019-11-28 02:47:05,868 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 02:47:05,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:47:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 02:47:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-28 02:47:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 02:47:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-11-28 02:47:05,872 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 78 [2019-11-28 02:47:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:05,874 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-11-28 02:47:05,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:47:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-11-28 02:47:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 02:47:05,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:05,875 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 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] [2019-11-28 02:47:06,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:06,080 INFO L410 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 484778976, now seen corresponding path program 1 times [2019-11-28 02:47:06,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:06,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560593908] [2019-11-28 02:47:06,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 02:47:06,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560593908] [2019-11-28 02:47:06,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110987531] [2019-11-28 02:47:06,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:47:06,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 02:47:06,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:06,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 11 [2019-11-28 02:47:06,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867680356] [2019-11-28 02:47:06,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:06,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:06,363 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 11 states. [2019-11-28 02:47:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:06,489 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-11-28 02:47:06,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:06,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-11-28 02:47:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:06,491 INFO L225 Difference]: With dead ends: 108 [2019-11-28 02:47:06,491 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 02:47:06,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 02:47:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-11-28 02:47:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:47:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-11-28 02:47:06,495 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 88 [2019-11-28 02:47:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:06,496 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-11-28 02:47:06,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-11-28 02:47:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 02:47:06,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:06,497 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2019-11-28 02:47:06,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:06,701 INFO L410 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1006834670, now seen corresponding path program 2 times [2019-11-28 02:47:06,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:06,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890875089] [2019-11-28 02:47:06,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 02:47:06,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890875089] [2019-11-28 02:47:06,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152835077] [2019-11-28 02:47:06,935 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:06,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:06,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:06,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:47:06,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:07,081 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-28 02:47:07,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-11-28 02:47:07,082 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,131 INFO L588 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-28 02:47:07,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:07,133 INFO L508 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-11-28 02:47:07,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:25, output treesize:45 [2019-11-28 02:47:07,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 02:47:07,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:07,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2019-11-28 02:47:07,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153622165] [2019-11-28 02:47:07,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 02:47:07,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 02:47:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:47:07,286 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 18 states. [2019-11-28 02:47:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:07,873 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-11-28 02:47:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:47:07,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-11-28 02:47:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:07,875 INFO L225 Difference]: With dead ends: 112 [2019-11-28 02:47:07,875 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 02:47:07,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:47:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 02:47:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2019-11-28 02:47:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:47:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-11-28 02:47:07,881 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 93 [2019-11-28 02:47:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:07,882 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-11-28 02:47:07,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 02:47:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-11-28 02:47:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 02:47:07,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:07,883 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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-11-28 02:47:08,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:08,087 INFO L410 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash 239434876, now seen corresponding path program 1 times [2019-11-28 02:47:08,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:08,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654486933] [2019-11-28 02:47:08,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-28 02:47:08,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654486933] [2019-11-28 02:47:08,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376022155] [2019-11-28 02:47:08,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:47:08,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-28 02:47:08,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:08,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 02:47:08,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779752104] [2019-11-28 02:47:08,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:47:08,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:08,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:47:08,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:08,402 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 14 states. [2019-11-28 02:47:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:08,637 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-11-28 02:47:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:08,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2019-11-28 02:47:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:08,639 INFO L225 Difference]: With dead ends: 127 [2019-11-28 02:47:08,639 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 02:47:08,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 02:47:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2019-11-28 02:47:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 02:47:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-11-28 02:47:08,643 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 102 [2019-11-28 02:47:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:08,644 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-11-28 02:47:08,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:47:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-11-28 02:47:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 02:47:08,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:08,645 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 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-11-28 02:47:08,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:08,846 INFO L410 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash 494137852, now seen corresponding path program 2 times [2019-11-28 02:47:08,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:08,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673786679] [2019-11-28 02:47:08,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-28 02:47:09,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673786679] [2019-11-28 02:47:09,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:09,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:47:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102687345] [2019-11-28 02:47:09,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:09,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:09,043 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 8 states. [2019-11-28 02:47:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:09,270 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-11-28 02:47:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:09,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-28 02:47:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:09,273 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:47:09,273 INFO L226 Difference]: Without dead ends: 117 [2019-11-28 02:47:09,273 INFO L630 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-11-28 02:47:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-28 02:47:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-28 02:47:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 02:47:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-11-28 02:47:09,278 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 112 [2019-11-28 02:47:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:09,278 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-11-28 02:47:09,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-11-28 02:47:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 02:47:09,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:09,280 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 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-11-28 02:47:09,280 INFO L410 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash 494137853, now seen corresponding path program 1 times [2019-11-28 02:47:09,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:09,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241375733] [2019-11-28 02:47:09,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 02:47:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241375733] [2019-11-28 02:47:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582533681] [2019-11-28 02:47:09,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:09,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-28 02:47:09,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:09,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 20 [2019-11-28 02:47:09,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519606073] [2019-11-28 02:47:09,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 02:47:09,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 02:47:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:47:09,812 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 20 states. [2019-11-28 02:47:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:10,370 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-11-28 02:47:10,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:10,371 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2019-11-28 02:47:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:10,373 INFO L225 Difference]: With dead ends: 124 [2019-11-28 02:47:10,373 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 02:47:10,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:47:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 02:47:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-11-28 02:47:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 02:47:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2019-11-28 02:47:10,382 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 112 [2019-11-28 02:47:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:10,382 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2019-11-28 02:47:10,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 02:47:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2019-11-28 02:47:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 02:47:10,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:10,383 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 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-11-28 02:47:10,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:10,584 INFO L410 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-28 02:47:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2019956747, now seen corresponding path program 2 times [2019-11-28 02:47:10,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:10,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162937534] [2019-11-28 02:47:10,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-28 02:47:11,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162937534] [2019-11-28 02:47:11,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935769538] [2019-11-28 02:47:11,143 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 02:47:11,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:11,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:11,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:47:11,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:11,294 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-11-28 02:47:11,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-11-28 02:47:11,295 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:11,329 INFO L588 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-11-28 02:47:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:11,331 INFO L508 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-11-28 02:47:11,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-11-28 02:47:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 02:47:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-28 02:47:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [21] total 24 [2019-11-28 02:47:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185803370] [2019-11-28 02:47:11,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:11,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:47:11,468 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 7 states. [2019-11-28 02:47:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:11,617 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-11-28 02:47:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:11,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-11-28 02:47:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:11,618 INFO L225 Difference]: With dead ends: 120 [2019-11-28 02:47:11,618 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:47:11,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-28 02:47:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:47:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:47:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:47:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:47:11,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-28 02:47:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:11,620 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:47:11,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:47:11,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:47:11,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:11,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:11 BoogieIcfgContainer [2019-11-28 02:47:11,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:11,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:11,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:11,830 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:11,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:38" (3/4) ... [2019-11-28 02:47:11,834 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:47:11,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:47:11,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-11-28 02:47:11,839 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-11-28 02:47:11,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-11-28 02:47:11,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:47:11,840 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-11-28 02:47:11,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2019-11-28 02:47:11,846 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:47:11,846 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:47:11,846 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:47:11,898 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:11,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:11,900 INFO L168 Benchmark]: Toolchain (without parser) took 34320.11 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -122.9 MB). Peak memory consumption was 344.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,900 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:11,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,901 INFO L168 Benchmark]: Boogie Preprocessor took 46.91 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,901 INFO L168 Benchmark]: RCFGBuilder took 512.76 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,902 INFO L168 Benchmark]: TraceAbstraction took 33287.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 350.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,902 INFO L168 Benchmark]: Witness Printer took 69.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 208.9 kB). Peak memory consumption was 208.9 kB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,905 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.91 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 512.76 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33287.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 350.6 MB. Max. memory is 11.5 GB. * Witness Printer took 69.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 208.9 kB). Peak memory consumption was 208.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. Result: SAFE, OverallTime: 33.2s, OverallIterations: 30, TraceHistogramMax: 10, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1311 SDtfs, 1650 SDslu, 6220 SDs, 0 SdLazy, 5392 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1214 SyntacticMatches, 76 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 121 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2881 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2831 ConstructedInterpolants, 138 QuantifiedInterpolants, 1074369 SizeOfPredicates, 59 NumberOfNonLiveVariables, 4481 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 50 InterpolantComputations, 16 PerfectInterpolantSequences, 3369/4613 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...