./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.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-0ed9222-m [2019-01-14 00:37:29,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:37:29,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:37:29,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:37:29,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:37:29,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:37:29,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:37:29,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:37:29,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:37:29,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:37:29,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:37:29,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:37:29,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:37:29,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:37:29,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:37:29,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:37:29,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:37:29,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:37:29,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:37:29,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:37:29,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:37:29,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:37:29,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:37:29,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:37:29,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:37:29,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:37:29,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:37:29,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:37:29,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:37:29,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:37:29,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:37:29,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:37:29,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:37:29,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:37:29,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:37:29,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:37:29,636 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:37:29,664 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:37:29,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:37:29,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:37:29,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:37:29,668 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:37:29,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:37:29,668 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:37:29,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:37:29,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:37:29,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:37:29,670 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:37:29,672 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:37:29,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:37:29,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:37:29,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:37:29,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:37:29,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:37:29,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:37:29,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:37:29,674 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:37:29,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:37:29,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-01-14 00:37:29,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:37:29,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:37:29,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:37:29,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:37:29,732 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:37:29,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-14 00:37:29,807 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751299902/96c6b64873fd4b7aae87a10a5aced301/FLAG2717869aa [2019-01-14 00:37:30,253 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:37:30,253 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-14 00:37:30,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751299902/96c6b64873fd4b7aae87a10a5aced301/FLAG2717869aa [2019-01-14 00:37:30,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751299902/96c6b64873fd4b7aae87a10a5aced301 [2019-01-14 00:37:30,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:37:30,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:37:30,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:30,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:37:30,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:37:30,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dac9110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30, skipping insertion in model container [2019-01-14 00:37:30,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:37:30,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:37:30,856 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:30,881 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:37:30,902 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:30,932 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:37:30,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30 WrapperNode [2019-01-14 00:37:30,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:30,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:37:30,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:37:30,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:37:30,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (1/1) ... [2019-01-14 00:37:30,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:37:30,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:37:30,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:37:30,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:37:30,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (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-01-14 00:37:31,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:37:31,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:37:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 00:37:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-14 00:37:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-14 00:37:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-14 00:37:31,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:37:31,098 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 00:37:31,098 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-14 00:37:31,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 00:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:37:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:37:31,710 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:37:31,711 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 00:37:31,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:31 BoogieIcfgContainer [2019-01-14 00:37:31,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:37:31,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:37:31,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:37:31,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:37:31,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:37:30" (1/3) ... [2019-01-14 00:37:31,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29486be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:31, skipping insertion in model container [2019-01-14 00:37:31,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:30" (2/3) ... [2019-01-14 00:37:31,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29486be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:31, skipping insertion in model container [2019-01-14 00:37:31,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:31" (3/3) ... [2019-01-14 00:37:31,720 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2019-01-14 00:37:31,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:37:31,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-14 00:37:31,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-14 00:37:31,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:37:31,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:37:31,779 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:37:31,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:37:31,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:37:31,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:37:31,780 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:37:31,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:37:31,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:37:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-14 00:37:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:31,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:31,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:31,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-14 00:37:31,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:32,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:32,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:32,123 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-14 00:37:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:32,274 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-01-14 00:37:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:32,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 00:37:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:32,284 INFO L225 Difference]: With dead ends: 68 [2019-01-14 00:37:32,284 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 00:37:32,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 00:37:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 00:37:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:37:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-14 00:37:32,323 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-01-14 00:37:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:32,324 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-14 00:37:32,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-14 00:37:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:32,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:32,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:32,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-14 00:37:32,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:32,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:37:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:37:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:37:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:37:32,551 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-01-14 00:37:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:32,776 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-01-14 00:37:32,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:32,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 00:37:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:32,779 INFO L225 Difference]: With dead ends: 66 [2019-01-14 00:37:32,779 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 00:37:32,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:37:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 00:37:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-14 00:37:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 00:37:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-14 00:37:32,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-01-14 00:37:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:32,790 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-14 00:37:32,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:37:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-14 00:37:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:37:32,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:32,792 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:32,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-14 00:37:32,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:32,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:32,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:33,176 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 00:37:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:37:33,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:33,436 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-01-14 00:37:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:34,114 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-14 00:37:34,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:34,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-14 00:37:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:34,118 INFO L225 Difference]: With dead ends: 65 [2019-01-14 00:37:34,119 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 00:37:34,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 00:37:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-14 00:37:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:37:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-14 00:37:34,129 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-01-14 00:37:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:34,129 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-14 00:37:34,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-14 00:37:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:37:34,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:34,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:34,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1275227987, now seen corresponding path program 1 times [2019-01-14 00:37:34,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:34,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:34,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:34,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:34,344 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2019-01-14 00:37:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:34,536 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-01-14 00:37:34,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:34,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 00:37:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:34,538 INFO L225 Difference]: With dead ends: 62 [2019-01-14 00:37:34,538 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 00:37:34,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 00:37:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 00:37:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 00:37:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-01-14 00:37:34,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 20 [2019-01-14 00:37:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:34,546 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-01-14 00:37:34,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-01-14 00:37:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:37:34,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:34,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:34,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:34,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1275227986, now seen corresponding path program 1 times [2019-01-14 00:37:34,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:34,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:34,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:34,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:34,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:34,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:37:34,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:37:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:37:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:34,747 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-01-14 00:37:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:34,791 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-01-14 00:37:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:34,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 00:37:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:34,793 INFO L225 Difference]: With dead ends: 67 [2019-01-14 00:37:34,793 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 00:37:34,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 00:37:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-14 00:37:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 00:37:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-14 00:37:34,799 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2019-01-14 00:37:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:34,800 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-14 00:37:34,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:37:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-14 00:37:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 00:37:34,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:34,801 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:34,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 2 times [2019-01-14 00:37:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:34,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:34,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:34,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:34,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:34,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:34,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:34,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 00:37:35,139 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:37:35,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 00:37:35,337 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 00:37:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 00:37:35,562 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 00:37:35,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 00:37:35,771 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 00:37:35,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 00:37:35,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:35,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:35,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2019-01-14 00:37:35,901 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:37:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 00:37:36,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:36,198 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 00:37:36,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 00:37:36,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:36,563 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,590 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,618 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:37:36,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:37:36,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:37:36,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 00:37:36,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:36,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 00:37:36,852 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,884 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,931 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,944 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:36,977 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:37,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:37:37,182 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 00:37:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:37:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2019-01-14 00:37:37,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:37:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:37:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:37:37,828 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-01-14 00:37:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:38,592 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-01-14 00:37:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:37:38,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-14 00:37:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:38,596 INFO L225 Difference]: With dead ends: 70 [2019-01-14 00:37:38,597 INFO L226 Difference]: Without dead ends: 70 [2019-01-14 00:37:38,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:37:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-14 00:37:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-01-14 00:37:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 00:37:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-14 00:37:38,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-01-14 00:37:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:38,604 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-14 00:37:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:37:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-14 00:37:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 00:37:38,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:38,607 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:38,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-01-14 00:37:38,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:38,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:38,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:38,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:38,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:38,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:39,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:39,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:39,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:39,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:37:39,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:39,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:39,179 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-01-14 00:37:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:39,392 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-01-14 00:37:39,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:39,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-14 00:37:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:39,397 INFO L225 Difference]: With dead ends: 73 [2019-01-14 00:37:39,397 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 00:37:39,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 00:37:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-14 00:37:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 00:37:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-14 00:37:39,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 27 [2019-01-14 00:37:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:39,414 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-14 00:37:39,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-14 00:37:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:37:39,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:39,420 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:39,421 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 2 times [2019-01-14 00:37:39,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:39,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:39,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:39,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:39,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:39,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:39,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:39,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:39,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2019-01-14 00:37:39,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2019-01-14 00:37:39,896 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 00:37:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2019-01-14 00:37:39,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:39,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2019-01-14 00:37:40,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 00:37:40,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:40,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:40,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:40,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:40,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:40,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 00:37:40,416 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 00:37:40,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,530 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-14 00:37:40,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 85 [2019-01-14 00:37:40,867 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-14 00:37:40,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:40,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 99 [2019-01-14 00:37:40,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-01-14 00:37:40,937 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:41,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2019-01-14 00:37:41,092 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-14 00:37:41,272 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:37:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:41,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 85 [2019-01-14 00:37:41,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:41,554 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:41,680 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:41,869 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:37:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2019-01-14 00:37:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:42,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 00:37:42,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:42,147 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:42,178 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:42,212 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:42,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:37:42,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:37:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:37:43,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 00:37:43,118 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-14 00:37:43,310 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-14 00:37:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 00:37:43,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-01-14 00:37:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:37:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:37:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:43,530 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2019-01-14 00:37:43,796 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 00:37:45,954 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 00:37:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:46,421 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-14 00:37:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:46,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-14 00:37:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:46,424 INFO L225 Difference]: With dead ends: 75 [2019-01-14 00:37:46,424 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 00:37:46,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 00:37:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-14 00:37:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 00:37:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-01-14 00:37:46,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2019-01-14 00:37:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:46,433 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-01-14 00:37:46,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:37:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-01-14 00:37:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 00:37:46,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:46,436 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:46,436 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 532455403, now seen corresponding path program 1 times [2019-01-14 00:37:46,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:46,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:46,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:46,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:46,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:46,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:46,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:46,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:37:46,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:37:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:37:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:46,676 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2019-01-14 00:37:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:46,728 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-14 00:37:46,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:46,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-14 00:37:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:46,731 INFO L225 Difference]: With dead ends: 78 [2019-01-14 00:37:46,732 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 00:37:46,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 00:37:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-01-14 00:37:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:37:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-01-14 00:37:46,738 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2019-01-14 00:37:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:46,739 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-01-14 00:37:46,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:37:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-01-14 00:37:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 00:37:46,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:46,742 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:46,742 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -428261788, now seen corresponding path program 2 times [2019-01-14 00:37:46,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:46,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:46,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:46,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:47,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:47,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:47,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:47,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:47,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 00:37:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 00:37:47,269 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 00:37:47,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2019-01-14 00:37:47,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2019-01-14 00:37:47,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2019-01-14 00:37:47,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:47,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:47,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:47,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 00:37:47,669 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 00:37:47,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 00:37:47,979 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 00:37:47,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:47,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 00:37:48,001 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2019-01-14 00:37:48,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:37:48,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 00:37:48,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:48,268 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,292 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,361 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:37:48,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:37:48,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:37:48,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 00:37:48,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:48,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 00:37:48,469 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,497 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,514 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,574 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,583 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:48,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:37:48,619 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 00:37:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 00:37:48,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:48,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-01-14 00:37:48,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:48,889 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 12 states. [2019-01-14 00:37:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:49,390 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-01-14 00:37:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:49,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-01-14 00:37:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:49,393 INFO L225 Difference]: With dead ends: 80 [2019-01-14 00:37:49,393 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 00:37:49,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:37:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 00:37:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-14 00:37:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 00:37:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-01-14 00:37:49,399 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 36 [2019-01-14 00:37:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:49,399 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-01-14 00:37:49,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-01-14 00:37:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:37:49,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:49,403 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:49,404 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 997106845, now seen corresponding path program 1 times [2019-01-14 00:37:49,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:49,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:49,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-14 00:37:49,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:49,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:49,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:49,599 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2019-01-14 00:37:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:49,707 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-14 00:37:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:49,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-14 00:37:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:49,710 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:37:49,710 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:37:49,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:37:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 00:37:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:37:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-14 00:37:49,714 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2019-01-14 00:37:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:49,715 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-14 00:37:49,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-14 00:37:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:37:49,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:49,716 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:49,717 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 997106846, now seen corresponding path program 1 times [2019-01-14 00:37:49,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:49,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:49,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:49,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:49,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:49,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:49,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:37:49,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:49,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:49,938 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2019-01-14 00:37:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:49,990 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-14 00:37:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:37:49,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-01-14 00:37:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:49,992 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:37:49,992 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:37:49,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:37:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-14 00:37:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 00:37:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-01-14 00:37:49,998 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 48 [2019-01-14 00:37:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:49,999 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-01-14 00:37:49,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-01-14 00:37:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 00:37:50,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:50,002 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:50,002 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834181, now seen corresponding path program 2 times [2019-01-14 00:37:50,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:50,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:50,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:50,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:50,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:50,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:50,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:50,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:50,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:50,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:50,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:50,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:37:50,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:37:50,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:37:50,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 00:37:50,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:50,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 00:37:50,883 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:50,924 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:50,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:50,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:50,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:50,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 00:37:51,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 00:37:51,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 00:37:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 00:37:51,424 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 00:37:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2019-01-14 00:37:51,446 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-14 00:37:51,522 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:51,603 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:37:51,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 00:37:51,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:51,755 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:51,791 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:51,828 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:51,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 00:37:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:51,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 00:37:52,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:52,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:52,042 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:52,074 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:52,090 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:52,108 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:52,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:52,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:37:52,145 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 00:37:52,560 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 00:37:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-14 00:37:52,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:52,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-01-14 00:37:52,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 00:37:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 00:37:52,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:37:52,949 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 16 states. [2019-01-14 00:37:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:53,807 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-01-14 00:37:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 00:37:53,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-01-14 00:37:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:53,809 INFO L225 Difference]: With dead ends: 85 [2019-01-14 00:37:53,810 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 00:37:53,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2019-01-14 00:37:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 00:37:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-01-14 00:37:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 00:37:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-14 00:37:53,814 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2019-01-14 00:37:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:53,814 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-14 00:37:53,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 00:37:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-14 00:37:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 00:37:53,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:53,817 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:53,817 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1040281730, now seen corresponding path program 1 times [2019-01-14 00:37:53,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:53,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:53,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:53,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:54,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:54,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:37:54,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:37:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:37:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:54,085 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2019-01-14 00:37:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:54,140 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-01-14 00:37:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:54,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-01-14 00:37:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:54,142 INFO L225 Difference]: With dead ends: 86 [2019-01-14 00:37:54,142 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 00:37:54,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 00:37:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-14 00:37:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 00:37:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-01-14 00:37:54,147 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 55 [2019-01-14 00:37:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:54,147 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-01-14 00:37:54,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:37:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-01-14 00:37:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 00:37:54,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:54,150 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:54,150 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163333, now seen corresponding path program 2 times [2019-01-14 00:37:54,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:54,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:54,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:37:54,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:54,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:54,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:54,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:54,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:54,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:54,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2019-01-14 00:37:54,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2019-01-14 00:37:54,467 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 00:37:54,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 00:37:54,657 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 00:37:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2019-01-14 00:37:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 00:37:54,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:54,782 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:54,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:54,844 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:54,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:54,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2019-01-14 00:37:55,107 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-14 00:37:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 99 [2019-01-14 00:37:55,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-01-14 00:37:55,155 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:55,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:55,626 INFO L303 Elim1Store]: Index analysis took 274 ms [2019-01-14 00:37:55,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2019-01-14 00:37:55,662 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-14 00:37:55,833 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:37:56,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 85 [2019-01-14 00:37:56,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:56,030 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,065 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:37:56,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:37:56,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2019-01-14 00:37:56,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2019-01-14 00:37:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:56,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 00:37:56,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 00:37:56,731 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,762 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,800 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:56,840 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:57,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:37:57,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:37:57,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 00:37:57,570 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-14 00:37:57,702 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-14 00:37:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:37:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-14 00:37:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:37:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:37:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:58,071 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2019-01-14 00:37:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:58,329 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-14 00:37:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:37:58,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 00:37:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:58,332 INFO L225 Difference]: With dead ends: 94 [2019-01-14 00:37:58,332 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 00:37:58,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 00:37:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-01-14 00:37:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 00:37:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-01-14 00:37:58,336 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 58 [2019-01-14 00:37:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:58,337 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-01-14 00:37:58,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:37:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-01-14 00:37:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 00:37:58,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:58,338 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:58,338 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768694, now seen corresponding path program 1 times [2019-01-14 00:37:58,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:37:58,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:58,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:58,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:58,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:37:58,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:58,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:37:58,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:58,529 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 6 states. [2019-01-14 00:37:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:58,602 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-14 00:37:58,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:37:58,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-14 00:37:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:58,605 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:37:58,605 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:37:58,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:37:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-01-14 00:37:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 00:37:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-14 00:37:58,609 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2019-01-14 00:37:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:58,609 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-14 00:37:58,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-14 00:37:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 00:37:58,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:58,610 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:58,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:37:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash 446605052, now seen corresponding path program 2 times [2019-01-14 00:37:58,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:58,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 00:37:58,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:58,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:58,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:58,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:58,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:58,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:37:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:37:58,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:37:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 00:37:58,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 00:37:58,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:58,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:58,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:58,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:58,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:58,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 00:37:58,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:58,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 00:37:59,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 00:37:59,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 00:37:59,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2019-01-14 00:37:59,227 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,250 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2019-01-14 00:37:59,452 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 00:37:59,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 00:37:59,474 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2019-01-14 00:37:59,542 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,597 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:37:59,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 00:37:59,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 00:37:59,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:37:59,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:37:59,801 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,816 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,827 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,858 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:37:59,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:37:59,884 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 00:38:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-14 00:38:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:38:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-14 00:38:00,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:38:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:38:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:38:00,203 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 9 states. [2019-01-14 00:38:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:00,689 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-14 00:38:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:38:00,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-01-14 00:38:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:00,692 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:38:00,692 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:38:00,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:38:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:38:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-14 00:38:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 00:38:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-01-14 00:38:00,697 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 68 [2019-01-14 00:38:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:00,697 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-01-14 00:38:00,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:38:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-01-14 00:38:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 00:38:00,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:00,702 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:00,702 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 417204474, now seen corresponding path program 1 times [2019-01-14 00:38:00,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:00,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:00,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:38:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-01-14 00:38:00,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:38:00,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:38:00,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:38:00,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:38:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:38:00,783 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 6 states. [2019-01-14 00:38:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:00,878 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-01-14 00:38:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:38:00,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-14 00:38:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:00,881 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:38:00,881 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:38:00,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:38:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:38:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 00:38:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:38:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-01-14 00:38:00,885 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 82 [2019-01-14 00:38:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:00,886 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-01-14 00:38:00,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:38:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-01-14 00:38:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 00:38:00,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:00,887 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:00,887 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash 417204475, now seen corresponding path program 1 times [2019-01-14 00:38:00,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:00,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:00,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:00,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:01,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:01,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:01,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:01,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:38:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:38:01,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:38:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:38:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:38:01,138 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 8 states. [2019-01-14 00:38:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:01,186 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-14 00:38:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:38:01,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-14 00:38:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:01,189 INFO L225 Difference]: With dead ends: 107 [2019-01-14 00:38:01,189 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 00:38:01,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:38:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 00:38:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-01-14 00:38:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:38:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-01-14 00:38:01,193 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 82 [2019-01-14 00:38:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:01,193 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-01-14 00:38:01,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:38:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-01-14 00:38:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-14 00:38:01,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:01,194 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:01,195 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057847, now seen corresponding path program 2 times [2019-01-14 00:38:01,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:01,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:01,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:01,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:01,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:38:01,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:38:01,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:38:01,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:01,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 00:38:01,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 00:38:01,756 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 00:38:01,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 00:38:01,947 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 00:38:01,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:01,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 00:38:02,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2019-01-14 00:38:02,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2019-01-14 00:38:02,340 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 00:38:02,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 00:38:02,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2019-01-14 00:38:02,435 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:38:02,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:38:02,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 00:38:02,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 00:38:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 00:38:02,694 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,714 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:38:02,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:38:02,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:38:02,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 00:38:02,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:02,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 00:38:02,823 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,848 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,862 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,875 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,886 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:02,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:38:02,919 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 00:38:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-01-14 00:38:03,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:38:03,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-14 00:38:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:38:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:38:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:38:03,322 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 13 states. [2019-01-14 00:38:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:03,946 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-01-14 00:38:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:38:03,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-01-14 00:38:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:03,949 INFO L225 Difference]: With dead ends: 112 [2019-01-14 00:38:03,949 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 00:38:03,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:38:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 00:38:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-01-14 00:38:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 00:38:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-14 00:38:03,953 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 87 [2019-01-14 00:38:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:03,953 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-14 00:38:03,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:38:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-14 00:38:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 00:38:03,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:03,955 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:03,955 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1649097355, now seen corresponding path program 1 times [2019-01-14 00:38:03,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:03,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:03,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:38:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:04,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:04,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:04,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:04,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:38:04,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:38:04,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:38:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:38:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:38:04,270 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 10 states. [2019-01-14 00:38:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:04,434 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 00:38:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:38:04,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-14 00:38:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:04,439 INFO L225 Difference]: With dead ends: 117 [2019-01-14 00:38:04,439 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 00:38:04,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:38:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 00:38:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-14 00:38:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 00:38:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-14 00:38:04,442 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 93 [2019-01-14 00:38:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:04,443 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-14 00:38:04,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:38:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-14 00:38:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 00:38:04,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:04,444 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:04,444 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 196128295, now seen corresponding path program 2 times [2019-01-14 00:38:04,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:04,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:05,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:05,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:38:05,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:38:05,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:38:05,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:05,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-14 00:38:05,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2019-01-14 00:38:05,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-14 00:38:05,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-14 00:38:05,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-14 00:38:05,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 00:38:05,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2019-01-14 00:38:05,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-14 00:38:05,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-14 00:38:05,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-14 00:38:05,804 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,820 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,836 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2019-01-14 00:38:05,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2019-01-14 00:38:05,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2019-01-14 00:38:05,901 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,919 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:05,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2019-01-14 00:38:05,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:05,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2019-01-14 00:38:06,000 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-14 00:38:06,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2019-01-14 00:38:06,089 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:06,152 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:38:06,226 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:38:06,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 00:38:06,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:38:06,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 00:38:06,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 00:38:06,555 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2019-01-14 00:38:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-01-14 00:38:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:38:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2019-01-14 00:38:06,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:38:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:38:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:38:06,680 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2019-01-14 00:38:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:06,979 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-01-14 00:38:06,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:38:06,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-01-14 00:38:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:06,984 INFO L225 Difference]: With dead ends: 121 [2019-01-14 00:38:06,984 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 00:38:06,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:38:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 00:38:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-14 00:38:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 00:38:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-01-14 00:38:06,990 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 98 [2019-01-14 00:38:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:06,991 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-01-14 00:38:06,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:38:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-01-14 00:38:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 00:38:06,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:06,993 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:06,993 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 916743350, now seen corresponding path program 1 times [2019-01-14 00:38:06,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:06,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:06,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:38:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:07,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:07,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:07,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:38:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:38:07,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:38:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:38:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:38:07,335 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 12 states. [2019-01-14 00:38:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:07,420 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-14 00:38:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:38:07,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-01-14 00:38:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:07,423 INFO L225 Difference]: With dead ends: 126 [2019-01-14 00:38:07,423 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 00:38:07,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:38:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 00:38:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-01-14 00:38:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 00:38:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-01-14 00:38:07,427 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 103 [2019-01-14 00:38:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:07,427 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-01-14 00:38:07,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:38:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-01-14 00:38:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-14 00:38:07,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:07,433 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:07,433 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120744, now seen corresponding path program 2 times [2019-01-14 00:38:07,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:07,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 00:38:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:07,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:07,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:38:07,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:38:07,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:38:07,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:07,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:38:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:07,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:38:07,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:07,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:07,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:38:07,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-14 00:38:07,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,059 INFO L303 Elim1Store]: Index analysis took 154 ms [2019-01-14 00:38:08,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2019-01-14 00:38:08,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 00:38:08,286 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 00:38:08,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2019-01-14 00:38:08,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2019-01-14 00:38:08,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2019-01-14 00:38:08,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-14 00:38:08,440 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,441 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,447 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-01-14 00:38:08,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2019-01-14 00:38:08,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-14 00:38:08,645 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,660 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 00:38:08,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-14 00:38:08,817 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:08,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 00:38:08,867 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,889 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,906 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:38:08,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,937 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:08,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:38:08,963 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-14 00:38:09,365 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 00:38:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-01-14 00:38:09,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:38:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2019-01-14 00:38:09,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 00:38:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 00:38:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-14 00:38:09,548 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 15 states. [2019-01-14 00:38:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:10,156 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-14 00:38:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:38:10,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-01-14 00:38:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:10,159 INFO L225 Difference]: With dead ends: 126 [2019-01-14 00:38:10,159 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 00:38:10,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-01-14 00:38:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 00:38:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-14 00:38:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 00:38:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2019-01-14 00:38:10,163 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 108 [2019-01-14 00:38:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:10,165 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2019-01-14 00:38:10,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 00:38:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2019-01-14 00:38:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 00:38:10,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:10,169 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:10,169 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1737944524, now seen corresponding path program 1 times [2019-01-14 00:38:10,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:10,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:38:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 00:38:10,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:38:10,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:38:10,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:38:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:38:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:38:10,358 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 6 states. [2019-01-14 00:38:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:10,449 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-14 00:38:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:38:10,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-01-14 00:38:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:10,452 INFO L225 Difference]: With dead ends: 125 [2019-01-14 00:38:10,452 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 00:38:10,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:38:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 00:38:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-14 00:38:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 00:38:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-01-14 00:38:10,456 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 122 [2019-01-14 00:38:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:10,456 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-01-14 00:38:10,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:38:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-01-14 00:38:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 00:38:10,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:10,457 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:10,458 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:10,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1737944523, now seen corresponding path program 1 times [2019-01-14 00:38:10,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:10,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 00:38:10,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:10,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:10,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 00:38:10,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:38:10,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:38:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:38:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:38:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:38:10,792 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 5 states. [2019-01-14 00:38:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:10,835 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2019-01-14 00:38:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:38:10,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-01-14 00:38:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:10,839 INFO L225 Difference]: With dead ends: 134 [2019-01-14 00:38:10,839 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 00:38:10,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:38:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 00:38:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-01-14 00:38:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 00:38:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2019-01-14 00:38:10,851 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 122 [2019-01-14 00:38:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:10,851 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2019-01-14 00:38:10,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:38:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2019-01-14 00:38:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 00:38:10,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:38:10,853 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:38:10,853 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:38:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:38:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212021, now seen corresponding path program 2 times [2019-01-14 00:38:10,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:38:10,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:38:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:38:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:38:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:38:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 00:38:11,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:38:11,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:38:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:38:11,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:38:11,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:38:11,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:38:11,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 00:38:11,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 00:38:11,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 00:38:11,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-14 00:38:11,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2019-01-14 00:38:11,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 00:38:11,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2019-01-14 00:38:11,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-01-14 00:38:11,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2019-01-14 00:38:11,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-14 00:38:11,572 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 00:38:11,648 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,666 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2019-01-14 00:38:11,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 00:38:11,745 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,756 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2019-01-14 00:38:11,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 00:38:11,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:38:11,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 00:38:11,835 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,837 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,841 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,855 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:38:11,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:38:11,874 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-14 00:38:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-01-14 00:38:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:38:12,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2019-01-14 00:38:12,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:38:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:38:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:38:12,270 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 10 states. [2019-01-14 00:38:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:38:12,628 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2019-01-14 00:38:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:38:12,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-01-14 00:38:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:38:12,629 INFO L225 Difference]: With dead ends: 139 [2019-01-14 00:38:12,629 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:38:12,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:38:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:38:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:38:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:38:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:38:12,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-01-14 00:38:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:38:12,630 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:38:12,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:38:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:38:12,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:38:12,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:38:12 BoogieIcfgContainer [2019-01-14 00:38:12,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:38:12,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:38:12,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:38:12,637 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:38:12,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:31" (3/4) ... [2019-01-14 00:38:12,643 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:38:12,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:38:12,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-01-14 00:38:12,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-01-14 00:38:12,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-01-14 00:38:12,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:38:12,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-01-14 00:38:12,658 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-01-14 00:38:12,658 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 00:38:12,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 00:38:12,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:38:12,720 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:38:12,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:38:12,722 INFO L168 Benchmark]: Toolchain (without parser) took 42138.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 436.7 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -56.3 MB). Peak memory consumption was 380.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,722 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:38:12,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,723 INFO L168 Benchmark]: Boogie Preprocessor took 44.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,723 INFO L168 Benchmark]: RCFGBuilder took 733.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,723 INFO L168 Benchmark]: TraceAbstraction took 40923.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 378.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,724 INFO L168 Benchmark]: Witness Printer took 83.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 00:38:12,728 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.03 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 733.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40923.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 378.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 40.8s OverallTime, 27 OverallIterations, 10 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1304 SDtfs, 1103 SDslu, 4887 SDs, 0 SdLazy, 2283 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1575 GetRequests, 1317 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 55 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 2975 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2928 ConstructedInterpolants, 570 QuantifiedInterpolants, 3440629 SizeOfPredicates, 58 NumberOfNonLiveVariables, 4391 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 5340/6904 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...