./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 91b1670e 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-91b1670 [2018-11-28 23:02:07,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:02:07,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:02:07,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:02:07,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:02:07,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:02:07,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:02:07,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:02:07,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:07,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:07,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:07,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:07,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:07,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:07,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:07,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:07,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:07,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:07,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:07,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:07,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:07,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:07,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:07,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:07,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:07,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:07,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:07,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:07,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:07,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:07,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:07,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:07,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:07,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:07,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:07,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:07,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:02:07,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:07,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:07,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:07,929 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:07,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:07,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:07,930 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:07,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:07,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:07,935 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:07,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:07,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:07,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:07,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:07,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:07,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:07,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:07,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:07,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:07,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:07,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:07,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:07,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:07,942 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 [2018-11-28 23:02:08,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:08,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:08,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:08,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:08,038 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:08,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-28 23:02:08,100 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1e8e82b/5f7e9d1a8b0d45cb8796afaf2fb3d989/FLAGff956967a [2018-11-28 23:02:08,530 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:08,531 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-28 23:02:08,537 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1e8e82b/5f7e9d1a8b0d45cb8796afaf2fb3d989/FLAGff956967a [2018-11-28 23:02:08,893 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1e8e82b/5f7e9d1a8b0d45cb8796afaf2fb3d989 [2018-11-28 23:02:08,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:08,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:08,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:08,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:08,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:08,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:08" (1/1) ... [2018-11-28 23:02:08,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6427cff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:08, skipping insertion in model container [2018-11-28 23:02:08,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:08" (1/1) ... [2018-11-28 23:02:08,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:08,941 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:09,189 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:09,218 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:09,260 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:09,297 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:09,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09 WrapperNode [2018-11-28 23:02:09,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:09,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:09,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:09,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:09,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (1/1) ... [2018-11-28 23:02:09,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:09,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:09,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:09,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:09,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (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 [2018-11-28 23:02:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-28 23:02:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-28 23:02:09,551 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:10,210 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:10,210 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:02:10,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:10 BoogieIcfgContainer [2018-11-28 23:02:10,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:10,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:10,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:10,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:10,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:08" (1/3) ... [2018-11-28 23:02:10,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b4752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:10, skipping insertion in model container [2018-11-28 23:02:10,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:09" (2/3) ... [2018-11-28 23:02:10,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b4752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:10, skipping insertion in model container [2018-11-28 23:02:10,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:10" (3/3) ... [2018-11-28 23:02:10,222 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-11-28 23:02:10,232 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:10,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-28 23:02:10,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-28 23:02:10,290 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:10,291 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:10,291 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:10,291 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:10,292 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:10,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:10,292 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:10,292 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:10,292 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-28 23:02:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:10,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,331 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2018-11-28 23:02:10,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:10,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:10,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:10,652 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-11-28 23:02:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,799 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-28 23:02:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:10,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 23:02:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,814 INFO L225 Difference]: With dead ends: 68 [2018-11-28 23:02:10,814 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 23:02:10,816 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 [2018-11-28 23:02:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 23:02:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-28 23:02:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 23:02:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-28 23:02:10,861 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-11-28 23:02:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,861 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-28 23:02:10,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-28 23:02:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:10,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2018-11-28 23:02:10,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:11,184 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:02:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:11,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:11,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:11,189 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-11-28 23:02:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:11,399 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-28 23:02:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:11,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 23:02:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:11,402 INFO L225 Difference]: With dead ends: 66 [2018-11-28 23:02:11,402 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 23:02:11,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 23:02:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-28 23:02:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:02:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-28 23:02:11,413 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-11-28 23:02:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:11,414 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-28 23:02:11,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-28 23:02:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:02:11,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:11,415 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:11,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:11,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:11,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2018-11-28 23:02:11,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:11,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:11,717 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-28 23:02:11,957 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-28 23:02:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:11,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:11,999 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 [2018-11-28 23:02:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:12,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:12,136 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 [2018-11-28 23:02:12,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:12,226 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 [2018-11-28 23:02:12,818 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:02:12,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:12,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:12,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:12,901 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 [2018-11-28 23:02:13,042 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-28 23:02:13,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,087 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 [2018-11-28 23:02:13,291 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-28 23:02:13,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,340 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 [2018-11-28 23:02:13,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,508 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 [2018-11-28 23:02:13,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:13,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,713 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 [2018-11-28 23:02:13,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,803 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 [2018-11-28 23:02:13,805 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,993 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 [2018-11-28 23:02:14,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,075 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 [2018-11-28 23:02:14,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,149 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 [2018-11-28 23:02:14,150 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,171 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,205 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,332 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 [2018-11-28 23:02:14,340 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 [2018-11-28 23:02:14,362 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 [2018-11-28 23:02:14,384 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 [2018-11-28 23:02:14,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:14,428 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 [2018-11-28 23:02:14,430 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,527 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,559 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,576 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,595 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:14,649 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. [2018-11-28 23:02:14,650 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-28 23:02:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:14,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:14,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-28 23:02:14,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:14,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:14,959 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 8 states. [2018-11-28 23:02:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:15,523 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 23:02:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:15,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 23:02:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:15,527 INFO L225 Difference]: With dead ends: 69 [2018-11-28 23:02:15,527 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 23:02:15,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 23:02:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-28 23:02:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:02:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 23:02:15,536 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-28 23:02:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:15,537 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 23:02:15,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 23:02:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 23:02:15,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:15,538 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:15,538 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:15,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:15,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2018-11-28 23:02:15,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:15,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:15,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:16,015 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2018-11-28 23:02:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:16,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:16,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:02:16,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:16,117 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-11-28 23:02:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:16,283 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-28 23:02:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:16,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 23:02:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:16,285 INFO L225 Difference]: With dead ends: 68 [2018-11-28 23:02:16,285 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:02:16,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:02:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-28 23:02:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 23:02:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-28 23:02:16,292 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2018-11-28 23:02:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:16,293 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-28 23:02:16,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-28 23:02:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:02:16,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:16,294 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] [2018-11-28 23:02:16,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:16,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2018-11-28 23:02:16,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:02:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:16,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:16,372 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-28 23:02:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:16,583 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-28 23:02:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:16,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 23:02:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:16,586 INFO L225 Difference]: With dead ends: 65 [2018-11-28 23:02:16,586 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 23:02:16,587 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 [2018-11-28 23:02:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 23:02:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 23:02:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:02:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-28 23:02:16,593 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2018-11-28 23:02:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:16,593 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-28 23:02:16,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-28 23:02:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:02:16,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:16,594 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] [2018-11-28 23:02:16,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:16,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2018-11-28 23:02:16,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:16,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:16,679 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 [2018-11-28 23:02:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:16,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:16,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:16,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:16,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:16,778 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-28 23:02:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:16,859 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-28 23:02:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:16,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 23:02:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:16,864 INFO L225 Difference]: With dead ends: 70 [2018-11-28 23:02:16,864 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 23:02:16,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 23:02:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-28 23:02:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:02:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 23:02:16,876 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-11-28 23:02:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:16,876 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 23:02:16,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 23:02:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:02:16,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:16,878 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] [2018-11-28 23:02:16,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:16,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2018-11-28 23:02:16,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:16,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:17,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:17,011 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 [2018-11-28 23:02:17,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:17,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:17,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:17,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:17,091 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 [2018-11-28 23:02:17,257 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 23:02:17,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,416 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 [2018-11-28 23:02:17,549 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:02:17,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,574 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 [2018-11-28 23:02:17,697 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-28 23:02:17,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,733 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 [2018-11-28 23:02:17,861 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-28 23:02:17,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:17,883 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 [2018-11-28 23:02:17,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:17,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,075 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-11-28 23:02:18,077 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 43 treesize of output 53 [2018-11-28 23:02:18,078 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,196 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 [2018-11-28 23:02:18,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,252 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 [2018-11-28 23:02:18,253 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,272 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,373 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 [2018-11-28 23:02:18,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,418 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 [2018-11-28 23:02:18,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,473 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 [2018-11-28 23:02:18,474 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,491 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,511 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,616 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 [2018-11-28 23:02:18,623 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 [2018-11-28 23:02:18,627 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 [2018-11-28 23:02:18,632 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 [2018-11-28 23:02:18,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:18,645 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 [2018-11-28 23:02:18,646 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,675 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,693 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,704 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,716 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:18,750 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. [2018-11-28 23:02:18,751 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-28 23:02:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:02:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:19,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-28 23:02:19,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:19,082 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-11-28 23:02:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:20,043 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-28 23:02:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:20,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-28 23:02:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:20,046 INFO L225 Difference]: With dead ends: 73 [2018-11-28 23:02:20,046 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 23:02:20,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:02:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 23:02:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-28 23:02:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 23:02:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-28 23:02:20,055 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-11-28 23:02:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:20,055 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-28 23:02:20,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-28 23:02:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:02:20,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:20,056 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] [2018-11-28 23:02:20,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:20,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 1 times [2018-11-28 23:02:20,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:20,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:20,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:20,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:20,146 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 [2018-11-28 23:02:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:20,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:20,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:20,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:02:20,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:20,342 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-11-28 23:02:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:20,391 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-28 23:02:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:20,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-28 23:02:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:20,392 INFO L225 Difference]: With dead ends: 76 [2018-11-28 23:02:20,394 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 23:02:20,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 23:02:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-28 23:02:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 23:02:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-28 23:02:20,415 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-11-28 23:02:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:20,416 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-28 23:02:20,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-28 23:02:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 23:02:20,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:20,417 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] [2018-11-28 23:02:20,417 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:20,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash 532455402, now seen corresponding path program 2 times [2018-11-28 23:02:20,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:20,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:20,558 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 [2018-11-28 23:02:20,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:20,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:20,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:20,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:20,633 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 [2018-11-28 23:02:20,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:20,691 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 [2018-11-28 23:02:20,882 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 23:02:20,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:20,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:20,890 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 [2018-11-28 23:02:21,041 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-11-28 23:02:21,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,053 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 [2018-11-28 23:02:21,157 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-28 23:02:21,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,166 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 [2018-11-28 23:02:21,169 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 [2018-11-28 23:02:21,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,362 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 [2018-11-28 23:02:21,506 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-28 23:02:21,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,520 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 [2018-11-28 23:02:21,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,591 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 [2018-11-28 23:02:21,598 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 [2018-11-28 23:02:21,599 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,632 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,773 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 [2018-11-28 23:02:21,925 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-11-28 23:02:21,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:21,941 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 54 treesize of output 85 [2018-11-28 23:02:21,949 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 [2018-11-28 23:02:21,950 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:21,986 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:22,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,096 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 52 treesize of output 99 [2018-11-28 23:02:22,109 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 [2018-11-28 23:02:22,110 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:22,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:22,297 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 [2018-11-28 23:02:22,299 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:22,451 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:02:22,604 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 23:02:22,780 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:02:22,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:23,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:23,661 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. [2018-11-28 23:02:23,662 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-11-28 23:02:23,821 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2018-11-28 23:02:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-28 23:02:24,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:24,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-11-28 23:02:24,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:02:24,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:02:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:24,064 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-11-28 23:02:24,667 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-28 23:02:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:24,836 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-28 23:02:24,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:24,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-28 23:02:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:24,839 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:02:24,839 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 23:02:24,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:02:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 23:02:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-28 23:02:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 23:02:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-28 23:02:24,845 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-11-28 23:02:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:24,846 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-28 23:02:24,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:02:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-28 23:02:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:02:24,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:24,847 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] [2018-11-28 23:02:24,847 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:24,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:24,847 INFO L82 PathProgramCache]: Analyzing trace with hash -428261788, now seen corresponding path program 1 times [2018-11-28 23:02:24,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:24,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:24,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:25,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:25,123 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 [2018-11-28 23:02:25,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:25,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:25,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:25,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:02:25,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:25,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:25,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:25,205 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 10 states. [2018-11-28 23:02:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:25,258 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-28 23:02:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:25,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-28 23:02:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:25,260 INFO L225 Difference]: With dead ends: 81 [2018-11-28 23:02:25,260 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 23:02:25,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 23:02:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-28 23:02:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 23:02:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-28 23:02:25,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2018-11-28 23:02:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-28 23:02:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-11-28 23:02:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 23:02:25,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:25,275 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] [2018-11-28 23:02:25,276 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:25,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 507961675, now seen corresponding path program 2 times [2018-11-28 23:02:25,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:25,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:25,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:25,400 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 [2018-11-28 23:02:25,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:25,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:25,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:25,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:25,467 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 [2018-11-28 23:02:25,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,506 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 [2018-11-28 23:02:25,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,560 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 [2018-11-28 23:02:25,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,648 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 [2018-11-28 23:02:25,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:25,774 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-28 23:02:25,775 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 [2018-11-28 23:02:25,776 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,079 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 [2018-11-28 23:02:26,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,118 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 [2018-11-28 23:02:26,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,214 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 [2018-11-28 23:02:26,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,562 INFO L303 Elim1Store]: Index analysis took 256 ms [2018-11-28 23:02:26,687 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 [2018-11-28 23:02:26,811 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-28 23:02:26,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,821 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 [2018-11-28 23:02:26,821 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:26,892 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 [2018-11-28 23:02:26,892 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:26,998 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:27,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,048 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 [2018-11-28 23:02:27,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,133 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 [2018-11-28 23:02:27,133 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,155 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,177 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,213 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 [2018-11-28 23:02:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,252 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 [2018-11-28 23:02:27,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:27,298 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 [2018-11-28 23:02:27,298 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,311 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,321 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,351 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:27,376 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. [2018-11-28 23:02:27,378 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-28 23:02:27,736 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:02:28,088 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:02:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-28 23:02:28,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:28,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-11-28 23:02:28,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:28,162 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 13 states. [2018-11-28 23:02:28,553 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:02:28,887 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:29,170 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:29,471 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:29,795 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:02:30,155 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:30,541 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:30,947 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:32,076 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-28 23:02:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:02:32,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-28 23:02:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:32,081 INFO L225 Difference]: With dead ends: 83 [2018-11-28 23:02:32,082 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 23:02:32,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:02:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 23:02:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-28 23:02:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 23:02:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-28 23:02:32,088 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 39 [2018-11-28 23:02:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:32,098 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-28 23:02:32,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-28 23:02:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 23:02:32,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:32,100 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] [2018-11-28 23:02:32,100 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:32,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834180, now seen corresponding path program 1 times [2018-11-28 23:02:32,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:32,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:32,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:32,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-28 23:02:32,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:32,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:32,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:32,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:32,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:32,533 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-11-28 23:02:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:33,082 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-28 23:02:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:33,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-28 23:02:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:33,085 INFO L225 Difference]: With dead ends: 80 [2018-11-28 23:02:33,086 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 23:02:33,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 23:02:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-28 23:02:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 23:02:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-28 23:02:33,090 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 51 [2018-11-28 23:02:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:33,090 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-28 23:02:33,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-28 23:02:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 23:02:33,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:33,092 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] [2018-11-28 23:02:33,092 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:33,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834181, now seen corresponding path program 1 times [2018-11-28 23:02:33,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:33,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:33,863 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 [2018-11-28 23:02:33,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:33,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:33,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:02:33,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:33,968 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 12 states. [2018-11-28 23:02:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:34,029 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-28 23:02:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:34,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-28 23:02:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:34,033 INFO L225 Difference]: With dead ends: 85 [2018-11-28 23:02:34,033 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 23:02:34,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 23:02:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-28 23:02:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:02:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-28 23:02:34,040 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2018-11-28 23:02:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:34,040 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-28 23:02:34,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-28 23:02:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 23:02:34,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:34,043 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] [2018-11-28 23:02:34,043 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:34,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368514, now seen corresponding path program 2 times [2018-11-28 23:02:34,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:34,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:34,243 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 [2018-11-28 23:02:34,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:34,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:34,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:34,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:34,296 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 [2018-11-28 23:02:34,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,304 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 [2018-11-28 23:02:34,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,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, 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 [2018-11-28 23:02:34,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,333 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 [2018-11-28 23:02:34,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,342 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 [2018-11-28 23:02:34,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:34,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:34,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:34,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:34,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:34,443 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 [2018-11-28 23:02:34,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,471 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 [2018-11-28 23:02:34,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,605 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 [2018-11-28 23:02:34,720 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-28 23:02:34,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,744 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 [2018-11-28 23:02:34,883 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-28 23:02:34,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:34,925 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 [2018-11-28 23:02:34,925 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,049 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 [2018-11-28 23:02:35,049 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,088 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,159 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 [2018-11-28 23:02:35,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,244 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 [2018-11-28 23:02:35,244 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,283 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,349 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 [2018-11-28 23:02:35,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,389 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 [2018-11-28 23:02:35,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:35,441 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 [2018-11-28 23:02:35,441 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,458 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,470 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,489 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:35,542 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. [2018-11-28 23:02:35,542 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-28 23:02:35,982 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:02:36,313 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 23:02:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-28 23:02:36,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:36,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2018-11-28 23:02:36,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 23:02:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 23:02:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:02:36,492 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2018-11-28 23:02:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:37,362 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-11-28 23:02:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 23:02:37,363 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-11-28 23:02:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:37,364 INFO L225 Difference]: With dead ends: 86 [2018-11-28 23:02:37,365 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 23:02:37,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2018-11-28 23:02:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 23:02:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-28 23:02:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 23:02:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-11-28 23:02:37,371 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 54 [2018-11-28 23:02:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:37,371 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-11-28 23:02:37,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 23:02:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-11-28 23:02:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 23:02:37,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:37,375 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] [2018-11-28 23:02:37,376 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163333, now seen corresponding path program 1 times [2018-11-28 23:02:37,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:37,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:37,516 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 [2018-11-28 23:02:37,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:37,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:37,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:37,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:02:37,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:37,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:37,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:37,647 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-11-28 23:02:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:37,672 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-28 23:02:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:37,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 23:02:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:37,674 INFO L225 Difference]: With dead ends: 95 [2018-11-28 23:02:37,674 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 23:02:37,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 23:02:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-11-28 23:02:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 23:02:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-28 23:02:37,684 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 58 [2018-11-28 23:02:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:37,684 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-28 23:02:37,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-28 23:02:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 23:02:37,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:37,689 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] [2018-11-28 23:02:37,689 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:37,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768695, now seen corresponding path program 2 times [2018-11-28 23:02:37,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:37,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:37,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:37,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:37,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:37,799 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 [2018-11-28 23:02:37,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:37,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:37,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:37,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:37,849 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 [2018-11-28 23:02:37,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:37,900 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 [2018-11-28 23:02:38,013 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 23:02:38,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,035 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 [2018-11-28 23:02:38,175 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-28 23:02:38,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,186 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 [2018-11-28 23:02:38,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,265 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 [2018-11-28 23:02:38,269 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 [2018-11-28 23:02:38,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,452 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 [2018-11-28 23:02:38,611 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-11-28 23:02:38,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,623 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 54 treesize of output 85 [2018-11-28 23:02:38,626 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 [2018-11-28 23:02:38,627 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,691 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,780 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 52 treesize of output 99 [2018-11-28 23:02:38,808 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 [2018-11-28 23:02:38,808 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:38,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:38,955 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 [2018-11-28 23:02:38,957 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:39,117 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:02:39,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 23:02:39,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:02:39,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,738 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 [2018-11-28 23:02:39,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,802 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 [2018-11-28 23:02:39,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:39,888 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 [2018-11-28 23:02:39,891 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 [2018-11-28 23:02:39,891 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:39,924 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:39,952 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:39,992 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:40,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:40,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:40,768 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. [2018-11-28 23:02:40,769 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-11-28 23:02:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-28 23:02:41,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:41,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-11-28 23:02:41,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:41,315 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2018-11-28 23:02:43,585 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 116 [2018-11-28 23:02:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:43,660 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-28 23:02:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:43,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-28 23:02:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:43,664 INFO L225 Difference]: With dead ends: 99 [2018-11-28 23:02:43,664 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 23:02:43,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 23:02:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-28 23:02:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 23:02:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-28 23:02:43,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2018-11-28 23:02:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:43,668 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-28 23:02:43,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-28 23:02:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 23:02:43,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:43,669 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] [2018-11-28 23:02:43,669 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 446605052, now seen corresponding path program 1 times [2018-11-28 23:02:43,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:43,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:43,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:43,762 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 [2018-11-28 23:02:43,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:43,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:43,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:43,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:02:43,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:43,886 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 7 states. [2018-11-28 23:02:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:43,939 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-28 23:02:43,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:43,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-28 23:02:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:43,943 INFO L225 Difference]: With dead ends: 104 [2018-11-28 23:02:43,943 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 23:02:43,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 23:02:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-11-28 23:02:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 23:02:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-28 23:02:43,957 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 68 [2018-11-28 23:02:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:43,957 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-28 23:02:43,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-28 23:02:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 23:02:43,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:43,958 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] [2018-11-28 23:02:43,958 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:43,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794826, now seen corresponding path program 2 times [2018-11-28 23:02:43,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:43,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:44,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:44,151 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 [2018-11-28 23:02:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:44,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:44,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:44,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:44,208 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 [2018-11-28 23:02:44,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,282 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 [2018-11-28 23:02:44,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,399 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 [2018-11-28 23:02:44,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,500 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 [2018-11-28 23:02:44,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,616 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 [2018-11-28 23:02:44,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:44,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:44,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,715 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 [2018-11-28 23:02:44,835 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-28 23:02:44,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,851 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 [2018-11-28 23:02:44,852 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:44,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:44,913 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 [2018-11-28 23:02:44,913 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:44,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:45,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:45,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,087 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 [2018-11-28 23:02:45,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,152 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 [2018-11-28 23:02:45,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,219 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 [2018-11-28 23:02:45,219 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,248 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,275 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,379 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 [2018-11-28 23:02:45,383 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 [2018-11-28 23:02:45,387 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 [2018-11-28 23:02:45,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, 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 [2018-11-28 23:02:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:45,403 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 [2018-11-28 23:02:45,404 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,449 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,468 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,486 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,496 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:45,530 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. [2018-11-28 23:02:45,531 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-28 23:02:45,886 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:02:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-11-28 23:02:46,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:46,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2018-11-28 23:02:46,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:46,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:46,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:46,099 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2018-11-28 23:02:46,490 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:02:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:46,903 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-28 23:02:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:46,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-28 23:02:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:46,905 INFO L225 Difference]: With dead ends: 108 [2018-11-28 23:02:46,905 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 23:02:46,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:02:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 23:02:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-11-28 23:02:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 23:02:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-28 23:02:46,909 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 73 [2018-11-28 23:02:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:46,910 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-28 23:02:46,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-28 23:02:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 23:02:46,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:46,912 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] [2018-11-28 23:02:46,912 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:46,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:46,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057848, now seen corresponding path program 1 times [2018-11-28 23:02:46,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:46,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:46,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:46,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-28 23:02:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:47,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:47,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:47,007 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 6 states. [2018-11-28 23:02:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:47,200 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-28 23:02:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:47,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-28 23:02:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:47,203 INFO L225 Difference]: With dead ends: 103 [2018-11-28 23:02:47,203 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 23:02:47,204 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 [2018-11-28 23:02:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 23:02:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-28 23:02:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 23:02:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-28 23:02:47,208 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 87 [2018-11-28 23:02:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:47,208 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-28 23:02:47,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-28 23:02:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 23:02:47,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:47,212 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] [2018-11-28 23:02:47,212 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:47,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057847, now seen corresponding path program 1 times [2018-11-28 23:02:47,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:47,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:47,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:47,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:47,933 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 [2018-11-28 23:02:47,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:48,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:48,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:48,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:02:48,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:02:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:02:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:48,164 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 9 states. [2018-11-28 23:02:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:48,257 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-28 23:02:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:48,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-28 23:02:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:48,261 INFO L225 Difference]: With dead ends: 112 [2018-11-28 23:02:48,261 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 23:02:48,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 23:02:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-28 23:02:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 23:02:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-28 23:02:48,268 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 87 [2018-11-28 23:02:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:48,268 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-28 23:02:48,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:02:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-28 23:02:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 23:02:48,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:48,270 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] [2018-11-28 23:02:48,273 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:48,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312005, now seen corresponding path program 2 times [2018-11-28 23:02:48,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:48,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:48,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:48,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:48,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:48,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:48,436 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 [2018-11-28 23:02:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:48,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:48,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:48,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:48,486 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 [2018-11-28 23:02:48,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,496 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 [2018-11-28 23:02:48,507 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 23 treesize of output 29 [2018-11-28 23:02:48,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,523 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 25 treesize of output 43 [2018-11-28 23:02:48,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 64 [2018-11-28 23:02:48,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,659 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 49 treesize of output 45 [2018-11-28 23:02:48,799 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 23:02:48,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,813 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 42 treesize of output 55 [2018-11-28 23:02:48,817 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 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-28 23:02:48,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,852 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 27 treesize of output 51 [2018-11-28 23:02:48,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-28 23:02:48,911 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,928 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:48,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:48,984 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 41 treesize of output 53 [2018-11-28 23:02:49,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,082 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 2 case distinctions, treesize of input 40 treesize of output 68 [2018-11-28 23:02:49,185 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-28 23:02:49,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,200 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 56 [2018-11-28 23:02:49,202 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-11-28 23:02:49,271 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,305 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:49,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,349 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 35 treesize of output 55 [2018-11-28 23:02:49,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:49,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-11-28 23:02:49,418 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,431 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,449 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:49,495 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. [2018-11-28 23:02:49,495 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:70, output treesize:45 [2018-11-28 23:02:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-11-28 23:02:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2018-11-28 23:02:49,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 23:02:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:02:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:02:49,965 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 14 states. [2018-11-28 23:02:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:50,774 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-28 23:02:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 23:02:50,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-11-28 23:02:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:50,777 INFO L225 Difference]: With dead ends: 117 [2018-11-28 23:02:50,777 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 23:02:50,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:02:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 23:02:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-11-28 23:02:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-28 23:02:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-28 23:02:50,781 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 92 [2018-11-28 23:02:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:50,781 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-28 23:02:50,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 23:02:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-28 23:02:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 23:02:50,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:50,784 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] [2018-11-28 23:02:50,785 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:50,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash 196128295, now seen corresponding path program 1 times [2018-11-28 23:02:50,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:50,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:50,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:50,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:51,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:51,172 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 [2018-11-28 23:02:51,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:51,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:51,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:51,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:02:51,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:51,279 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2018-11-28 23:02:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:51,345 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-11-28 23:02:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:51,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-28 23:02:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:51,350 INFO L225 Difference]: With dead ends: 122 [2018-11-28 23:02:51,350 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 23:02:51,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 23:02:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-11-28 23:02:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 23:02:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-11-28 23:02:51,354 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 98 [2018-11-28 23:02:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:51,355 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-11-28 23:02:51,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-28 23:02:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 23:02:51,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:51,356 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] [2018-11-28 23:02:51,356 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:51,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 916743349, now seen corresponding path program 2 times [2018-11-28 23:02:51,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:51,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:51,794 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 [2018-11-28 23:02:51,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:51,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:51,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:51,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:51,844 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 [2018-11-28 23:02:51,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:51,936 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 [2018-11-28 23:02:51,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:51,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:51,962 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 [2018-11-28 23:02:51,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:51,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:51,990 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 32 treesize of output 42 [2018-11-28 23:02:51,997 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 [2018-11-28 23:02:52,008 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 [2018-11-28 23:02:52,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,085 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 [2018-11-28 23:02:52,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:52,112 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 [2018-11-28 23:02:52,113 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:52,190 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 [2018-11-28 23:02:52,191 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,256 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:02:52,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 23:02:52,419 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 [2018-11-28 23:02:52,429 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 [2018-11-28 23:02:52,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, 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 [2018-11-28 23:02:52,447 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,459 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,491 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:02:52,683 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 [2018-11-28 23:02:52,687 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 [2018-11-28 23:02:52,698 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 [2018-11-28 23:02:52,711 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 [2018-11-28 23:02:52,712 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,721 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,731 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,742 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:52,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:52,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:02:52,987 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. [2018-11-28 23:02:52,988 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2018-11-28 23:02:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-28 23:02:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2018-11-28 23:02:53,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:53,168 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 12 states. [2018-11-28 23:02:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:53,584 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-28 23:02:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:53,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-11-28 23:02:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:53,587 INFO L225 Difference]: With dead ends: 126 [2018-11-28 23:02:53,587 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 23:02:53,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:02:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 23:02:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-11-28 23:02:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 23:02:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-28 23:02:53,591 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 103 [2018-11-28 23:02:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-28 23:02:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-28 23:02:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 23:02:53,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:53,593 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] [2018-11-28 23:02:53,593 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:53,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120744, now seen corresponding path program 1 times [2018-11-28 23:02:53,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:53,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:53,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:54,679 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 [2018-11-28 23:02:54,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:54,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-28 23:02:54,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:54,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 23:02:54,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:54,843 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 13 states. [2018-11-28 23:02:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:54,931 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-28 23:02:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:54,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-11-28 23:02:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:54,935 INFO L225 Difference]: With dead ends: 127 [2018-11-28 23:02:54,935 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 23:02:54,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 23:02:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-28 23:02:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 23:02:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-28 23:02:54,942 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 108 [2018-11-28 23:02:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:54,942 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-28 23:02:54,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-28 23:02:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 23:02:54,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:54,949 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] [2018-11-28 23:02:54,949 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:54,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -184159242, now seen corresponding path program 2 times [2018-11-28 23:02:54,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:54,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:54,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-28 23:02:55,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:55,096 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 [2018-11-28 23:02:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:55,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:55,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:55,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:55,159 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 [2018-11-28 23:02:55,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,166 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 [2018-11-28 23:02:55,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,177 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 [2018-11-28 23:02:55,183 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 [2018-11-28 23:02:55,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,197 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 [2018-11-28 23:02:55,198 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,278 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 [2018-11-28 23:02:55,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,303 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 [2018-11-28 23:02:55,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,421 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 [2018-11-28 23:02:55,439 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 [2018-11-28 23:02:55,561 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-28 23:02:55,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,583 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 [2018-11-28 23:02:55,584 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,650 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 [2018-11-28 23:02:55,651 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,678 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,730 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 [2018-11-28 23:02:55,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,779 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 [2018-11-28 23:02:55,780 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,790 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,832 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 [2018-11-28 23:02:55,836 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 [2018-11-28 23:02:55,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:55,874 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 [2018-11-28 23:02:55,875 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,878 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,884 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:55,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. [2018-11-28 23:02:55,920 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-11-28 23:02:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-28 23:02:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:56,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-28 23:02:56,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:56,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:56,215 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 7 states. [2018-11-28 23:02:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:56,394 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-28 23:02:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:56,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 23:02:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:56,397 INFO L225 Difference]: With dead ends: 135 [2018-11-28 23:02:56,397 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 23:02:56,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 23:02:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-11-28 23:02:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 23:02:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-28 23:02:56,401 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 113 [2018-11-28 23:02:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:56,402 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-28 23:02:56,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-28 23:02:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 23:02:56,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:56,403 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] [2018-11-28 23:02:56,403 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:56,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212022, now seen corresponding path program 1 times [2018-11-28 23:02:56,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:56,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-28 23:02:56,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:56,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:56,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:56,622 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 6 states. [2018-11-28 23:02:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:56,715 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-28 23:02:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:56,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-28 23:02:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:56,719 INFO L225 Difference]: With dead ends: 130 [2018-11-28 23:02:56,719 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 23:02:56,719 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 [2018-11-28 23:02:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 23:02:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 23:02:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:02:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-11-28 23:02:56,724 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2018-11-28 23:02:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:56,724 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-11-28 23:02:56,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-28 23:02:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 23:02:56,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:56,728 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] [2018-11-28 23:02:56,728 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:56,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212021, now seen corresponding path program 1 times [2018-11-28 23:02:56,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:56,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:56,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-28 23:02:56,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:56,876 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 [2018-11-28 23:02:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:56,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-28 23:02:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:57,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:57,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:57,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:57,079 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 6 states. [2018-11-28 23:02:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:57,104 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-28 23:02:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:57,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-28 23:02:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:57,107 INFO L225 Difference]: With dead ends: 139 [2018-11-28 23:02:57,107 INFO L226 Difference]: Without dead ends: 139 [2018-11-28 23:02:57,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-28 23:02:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-28 23:02:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-28 23:02:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-28 23:02:57,111 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 127 [2018-11-28 23:02:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:57,111 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-28 23:02:57,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-28 23:02:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-28 23:02:57,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:57,112 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:57,113 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:57,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash 82106357, now seen corresponding path program 2 times [2018-11-28 23:02:57,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:57,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-28 23:02:57,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:57,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:57,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:57,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:57,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:57,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:57,386 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 [2018-11-28 23:02:57,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,393 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 [2018-11-28 23:02:57,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,399 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 [2018-11-28 23:02:57,482 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 [2018-11-28 23:02:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,498 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 [2018-11-28 23:02:57,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,607 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 [2018-11-28 23:02:57,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,632 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 [2018-11-28 23:02:57,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,713 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 [2018-11-28 23:02:57,726 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 [2018-11-28 23:02:57,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,831 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 40 treesize of output 40 [2018-11-28 23:02:57,832 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-11-28 23:02:57,885 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:57,910 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:57,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,951 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 [2018-11-28 23:02:57,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:57,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,002 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 [2018-11-28 23:02:58,002 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,015 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,029 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,059 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 [2018-11-28 23:02:58,063 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 [2018-11-28 23:02:58,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:58,103 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 [2018-11-28 23:02:58,103 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,107 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,114 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:58,151 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. [2018-11-28 23:02:58,152 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-11-28 23:02:58,506 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:02:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-28 23:02:58,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:58,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-28 23:02:58,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:58,777 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 11 states. [2018-11-28 23:02:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:59,157 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-28 23:02:59,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:59,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-11-28 23:02:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:59,158 INFO L225 Difference]: With dead ends: 144 [2018-11-28 23:02:59,158 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:02:59,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:02:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:02:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:02:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:02:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:02:59,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-11-28 23:02:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:59,160 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:02:59,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:02:59,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:02:59,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:59 BoogieIcfgContainer [2018-11-28 23:02:59,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:59,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:59,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:59,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:59,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:10" (3/4) ... [2018-11-28 23:02:59,172 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:02:59,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:02:59,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-11-28 23:02:59,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-11-28 23:02:59,186 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-11-28 23:02:59,186 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:02:59,186 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-11-28 23:02:59,193 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-28 23:02:59,193 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 23:02:59,194 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:02:59,194 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:02:59,245 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:59,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:59,249 INFO L168 Benchmark]: Toolchain (without parser) took 50350.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.6 MB). Free memory was 951.4 MB in the beginning and 945.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 440.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:59,249 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-28 23:02:59,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.68 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. [2018-11-28 23:02:59,251 INFO L168 Benchmark]: Boogie Preprocessor took 82.26 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:59,251 INFO L168 Benchmark]: RCFGBuilder took 828.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:59,252 INFO L168 Benchmark]: TraceAbstraction took 48953.81 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 122.8 MB). Peak memory consumption was 447.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:59,252 INFO L168 Benchmark]: Witness Printer took 81.29 ms. Allocated memory is still 1.5 GB. Free memory was 946.0 MB in the beginning and 945.6 MB in the end (delta: 328.0 kB). Peak memory consumption was 328.0 kB. Max. memory is 11.5 GB. [2018-11-28 23:02:59,254 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.16 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 399.68 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 82.26 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 828.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48953.81 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 122.8 MB). Peak memory consumption was 447.9 MB. Max. memory is 11.5 GB. * Witness Printer took 81.29 ms. Allocated memory is still 1.5 GB. Free memory was 946.0 MB in the beginning and 945.6 MB in the end (delta: 328.0 kB). Peak memory consumption was 328.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 48.8s OverallTime, 28 OverallIterations, 10 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1352 SDtfs, 1215 SDslu, 5695 SDs, 0 SdLazy, 2405 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1683 GetRequests, 1416 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=27, 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, 28 MinimizatonAttempts, 58 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3139 ConstructedInterpolants, 620 QuantifiedInterpolants, 3837226 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4532 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 6125/7756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...