./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:49:52,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:52,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:52,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:52,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:52,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:52,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:52,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:52,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:52,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:52,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:52,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:52,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:52,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:52,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:52,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:52,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:52,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:52,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:52,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:52,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:52,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:52,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:52,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:52,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:52,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:52,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:52,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:52,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:52,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:52,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:52,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:52,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:52,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:52,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:52,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:52,952 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:52,983 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:52,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:52,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:52,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:52,985 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:52,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:52,986 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:52,986 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:52,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:52,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:52,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:52,987 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:52,987 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:52,987 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:52,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:52,987 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:52,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:52,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:52,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:52,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:52,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:52,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:52,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:52,989 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:52,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:52,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2019-01-14 20:49:53,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:53,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:53,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:53,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:53,049 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:53,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-14 20:49:53,113 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104c0b83b/53efc4df0f244b6e998e99fae8ee3913/FLAGe7d493d2e [2019-01-14 20:49:53,521 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:53,522 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-14 20:49:53,528 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104c0b83b/53efc4df0f244b6e998e99fae8ee3913/FLAGe7d493d2e [2019-01-14 20:49:53,900 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104c0b83b/53efc4df0f244b6e998e99fae8ee3913 [2019-01-14 20:49:53,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:53,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:53,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:53,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:53,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:53,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:53" (1/1) ... [2019-01-14 20:49:53,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630dbd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:53, skipping insertion in model container [2019-01-14 20:49:53,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:53" (1/1) ... [2019-01-14 20:49:53,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:53,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:54,201 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:54,219 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:54,242 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:54,268 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:54,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54 WrapperNode [2019-01-14 20:49:54,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:54,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:54,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:54,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:54,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... [2019-01-14 20:49:54,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:54,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:54,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:54,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:54,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 20:49:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-14 20:49:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-14 20:49:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-14 20:49:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 20:49:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 20:49:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:49:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 20:49:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:55,117 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:55,118 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 20:49:55,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:55 BoogieIcfgContainer [2019-01-14 20:49:55,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:55,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:55,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:55,127 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:55,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:53" (1/3) ... [2019-01-14 20:49:55,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a05ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:55, skipping insertion in model container [2019-01-14 20:49:55,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:54" (2/3) ... [2019-01-14 20:49:55,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a05ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:55, skipping insertion in model container [2019-01-14 20:49:55,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:55" (3/3) ... [2019-01-14 20:49:55,131 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2019-01-14 20:49:55,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:55,146 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-14 20:49:55,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-14 20:49:55,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:55,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:55,189 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:55,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:55,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:55,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:55,190 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:55,190 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:55,190 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-14 20:49:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:55,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:55,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:55,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-14 20:49:55,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:55,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:55,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:55,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:55,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:55,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:55,510 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-14 20:49:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:55,679 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-01-14 20:49:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:55,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:49:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:55,690 INFO L225 Difference]: With dead ends: 68 [2019-01-14 20:49:55,690 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 20:49:55,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 20:49:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 20:49:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 20:49:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-14 20:49:55,728 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-01-14 20:49:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:55,729 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-14 20:49:55,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-14 20:49:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:55,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:55,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:55,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-14 20:49:55,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:55,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:56,130 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-01-14 20:49:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:56,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:56,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:56,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 20:49:56,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 20:49:56,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:56,222 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-01-14 20:49:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:56,663 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-01-14 20:49:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:56,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 20:49:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:56,665 INFO L225 Difference]: With dead ends: 66 [2019-01-14 20:49:56,665 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 20:49:56,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 20:49:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-14 20:49:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 20:49:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-14 20:49:56,676 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-01-14 20:49:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:56,677 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-14 20:49:56,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 20:49:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-14 20:49:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:49:56,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:56,678 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:56,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-14 20:49:56,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:56,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:56,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:56,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:57,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:57,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:57,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:57,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:49:57,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:49:57,652 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 20:49:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49: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, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:49:57,875 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 20:49:57,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:57,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 20:49:58,194 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:49:58,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 20:49:58,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:58,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2019-01-14 20:49:58,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:58,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:49:58,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 20:49:58,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:49:58,672 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:58,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:58,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:49:58,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:58,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,019 INFO L303 Elim1Store]: Index analysis took 128 ms [2019-01-14 20:49:59,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:49:59,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:49:59,090 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,109 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,131 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:49:59,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:49:59,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:49:59,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:49:59,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:59,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:49:59,265 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,300 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,318 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,332 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,345 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:59,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:59,385 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:49:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:59,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:59,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-14 20:49:59,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:59,777 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-01-14 20:50:00,267 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 20:50:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:00,466 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 20:50:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:50:00,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-14 20:50:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:00,469 INFO L225 Difference]: With dead ends: 69 [2019-01-14 20:50:00,469 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 20:50:00,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 20:50:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 20:50:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 20:50:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-14 20:50:00,478 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-01-14 20:50:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:00,478 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-14 20:50:00,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:50:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-14 20:50:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:50:00,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:00,481 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] [2019-01-14 20:50:00,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash -16477363, now seen corresponding path program 1 times [2019-01-14 20:50:00,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:00,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 20:50:00,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:50:00,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:50:00,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:50:00,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:50:00,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:00,650 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-01-14 20:50:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:00,835 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-01-14 20:50:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:00,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 20:50:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:00,838 INFO L225 Difference]: With dead ends: 68 [2019-01-14 20:50:00,838 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 20:50:00,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 20:50:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 20:50:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 20:50:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-14 20:50:00,847 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2019-01-14 20:50:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:00,848 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-14 20:50:00,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:50:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-14 20:50:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:50:00,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:00,849 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] [2019-01-14 20:50:00,850 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 1 times [2019-01-14 20:50:00,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:00,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:00,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:00,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:00,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:01,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:01,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:01,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:50:01,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:50:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:50:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:50:01,042 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-01-14 20:50:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:01,120 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-01-14 20:50:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:01,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-14 20:50:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:01,125 INFO L225 Difference]: With dead ends: 73 [2019-01-14 20:50:01,125 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 20:50:01,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:50:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 20:50:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-14 20:50:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 20:50:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-14 20:50:01,135 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2019-01-14 20:50:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:01,136 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-14 20:50:01,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:50:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-14 20:50:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 20:50:01,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:01,137 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] [2019-01-14 20:50:01,137 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 2 times [2019-01-14 20:50:01,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:01,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:01,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:01,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:01,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:01,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:01,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:01,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:01,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:01,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:01,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:01,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:50:01,614 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 20:50:01,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:01,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:50:01,982 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 20:50:01,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:01,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:01,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:50:02,300 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 20:50:02,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 20:50:02,515 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:50:02,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2019-01-14 20:50:02,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,659 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 [2019-01-14 20:50:02,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 20:50:02,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:02,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:02,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:50:02,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:02,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:50:03,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:03,039 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,057 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,077 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:03,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:03,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:03,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:50:03,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:03,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:50:03,209 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,262 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,276 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,289 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,300 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:03,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:03,336 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:50:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 20:50:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 20:50:03,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:50:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:50:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:03,715 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 12 states. [2019-01-14 20:50:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:04,478 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-01-14 20:50:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:50:04,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-14 20:50:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:04,482 INFO L225 Difference]: With dead ends: 76 [2019-01-14 20:50:04,482 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 20:50:04,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:50:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 20:50:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-01-14 20:50:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 20:50:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-01-14 20:50:04,491 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2019-01-14 20:50:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:04,492 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-01-14 20:50:04,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:50:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-01-14 20:50:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 20:50:04,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:04,493 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:04,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:04,496 INFO L82 PathProgramCache]: Analyzing trace with hash 532455402, now seen corresponding path program 1 times [2019-01-14 20:50:04,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:04,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:04,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:04,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:04,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:04,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:04,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:04,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:50:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:50:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:50:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:50:04,814 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2019-01-14 20:50:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:04,913 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-14 20:50:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:50:04,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-14 20:50:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:04,915 INFO L225 Difference]: With dead ends: 79 [2019-01-14 20:50:04,915 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 20:50:04,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:50:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 20:50:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-14 20:50:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 20:50:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-14 20:50:04,923 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 33 [2019-01-14 20:50:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:04,924 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-14 20:50:04,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:50:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-14 20:50:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:50:04,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:04,927 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:04,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash -428261789, now seen corresponding path program 2 times [2019-01-14 20:50:04,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:04,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:04,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:05,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:05,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:05,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:05,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:05,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:05,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:05,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2019-01-14 20:50:05,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2019-01-14 20:50:05,469 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 20:50:05,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2019-01-14 20:50:05,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2019-01-14 20:50:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 20:50:05,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:05,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:05,695 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:05,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:05,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:05,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:05,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 20:50:06,054 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 20:50:06,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2019-01-14 20:50:06,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 20:50:06,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:06,143 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,174 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2019-01-14 20:50:06,615 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-14 20:50:06,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,656 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 [2019-01-14 20:50:06,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:06,662 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,698 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,812 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 [2019-01-14 20:50:06,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-01-14 20:50:06,820 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:06,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:06,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2019-01-14 20:50:06,960 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2019-01-14 20:50:07,124 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:50:07,274 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:50:07,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:50:07,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:07,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:08,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 20:50:08,368 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-14 20:50:08,536 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-14 20:50:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 20:50:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-01-14 20:50:08,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:50:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:50:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:50:08,774 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 10 states. [2019-01-14 20:50:10,924 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 20:50:11,219 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-14 20:50:13,536 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 116 [2019-01-14 20:50:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:13,771 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-01-14 20:50:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:50:13,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-14 20:50:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:13,774 INFO L225 Difference]: With dead ends: 81 [2019-01-14 20:50:13,774 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 20:50:13,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-01-14 20:50:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 20:50:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-01-14 20:50:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 20:50:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-01-14 20:50:13,790 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2019-01-14 20:50:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:13,790 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-01-14 20:50:13,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:50:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-01-14 20:50:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 20:50:13,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:13,794 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] [2019-01-14 20:50:13,794 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 507961675, now seen corresponding path program 1 times [2019-01-14 20:50:13,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:13,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:13,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:13,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:14,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:14,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:14,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:14,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:50:14,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:50:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:50:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:50:14,109 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 11 states. [2019-01-14 20:50:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:14,173 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-01-14 20:50:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:50:14,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 20:50:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:14,177 INFO L225 Difference]: With dead ends: 84 [2019-01-14 20:50:14,177 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 20:50:14,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:50:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 20:50:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-01-14 20:50:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 20:50:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-01-14 20:50:14,184 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 39 [2019-01-14 20:50:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:14,184 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-01-14 20:50:14,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:50:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-01-14 20:50:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 20:50:14,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:14,188 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] [2019-01-14 20:50:14,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash 23527684, now seen corresponding path program 2 times [2019-01-14 20:50:14,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:14,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:50:14,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:14,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:14,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:14,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:14,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:14,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:14,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:14,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:14,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:50:14,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:50:14,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:14,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:14,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:14,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:14,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:14,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:50:14,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:50:14,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:50:14,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 20:50:14,963 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:50:14,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2019-01-14 20:50:14,975 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-14 20:50:15,099 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,208 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:15,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 20:50:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:15,401 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,435 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,468 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:50:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:50:15,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:15,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:15,598 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,613 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,625 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,643 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,712 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:15,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:15,738 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:50:16,101 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 20:50:16,472 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 20:50:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-01-14 20:50:16,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:16,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2019-01-14 20:50:16,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 20:50:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 20:50:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-01-14 20:50:16,596 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 14 states. [2019-01-14 20:50:17,026 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 20:50:17,373 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 20:50:17,648 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 20:50:17,953 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 20:50:18,283 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 20:50:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:18,702 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-01-14 20:50:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:50:18,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-01-14 20:50:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:18,706 INFO L225 Difference]: With dead ends: 86 [2019-01-14 20:50:18,706 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 20:50:18,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-14 20:50:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 20:50:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-01-14 20:50:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 20:50:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-01-14 20:50:18,712 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 42 [2019-01-14 20:50:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:18,712 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-01-14 20:50:18,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 20:50:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-01-14 20:50:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 20:50:18,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:18,716 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] [2019-01-14 20:50:18,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368515, now seen corresponding path program 1 times [2019-01-14 20:50:18,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:18,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:18,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-14 20:50:19,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:50:19,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:50:19,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:50:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:50:19,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:19,110 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2019-01-14 20:50:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:19,590 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-14 20:50:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:19,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-14 20:50:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:19,593 INFO L225 Difference]: With dead ends: 83 [2019-01-14 20:50:19,594 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 20:50:19,594 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 [2019-01-14 20:50:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 20:50:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-14 20:50:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 20:50:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-14 20:50:19,600 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 54 [2019-01-14 20:50:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-14 20:50:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:50:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-14 20:50:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 20:50:19,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:19,602 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] [2019-01-14 20:50:19,604 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368514, now seen corresponding path program 1 times [2019-01-14 20:50:19,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:19,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:50:19,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:19,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:19,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:19,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:50:19,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:19,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:50:19,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:50:19,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:50:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:50:19,979 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2019-01-14 20:50:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:20,046 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-01-14 20:50:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:50:20,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-01-14 20:50:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:20,052 INFO L225 Difference]: With dead ends: 86 [2019-01-14 20:50:20,052 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 20:50:20,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:50:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 20:50:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-14 20:50:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 20:50:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-01-14 20:50:20,062 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 54 [2019-01-14 20:50:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:20,062 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-01-14 20:50:20,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:50:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-01-14 20:50:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 20:50:20,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:20,067 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] [2019-01-14 20:50:20,069 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:20,069 INFO L82 PathProgramCache]: Analyzing trace with hash -590033307, now seen corresponding path program 2 times [2019-01-14 20:50:20,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:20,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:20,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:20,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:20,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:20,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:20,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:20,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:20,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:20,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:20,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:20,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:20,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:20,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:50:20,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:50:20,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:20,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:20,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:20,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:20,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:20,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:50:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:50:20,540 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 20:50:20,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:50:20,693 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 20:50:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,808 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-14 20:50:20,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2019-01-14 20:50:20,940 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:50:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:20,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 20:50:20,956 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2019-01-14 20:50:21,020 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,067 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,242 INFO L303 Elim1Store]: Index analysis took 139 ms [2019-01-14 20:50:21,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2019-01-14 20:50:21,426 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-01-14 20:50:21,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:21,437 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,453 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,476 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:50:21,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:50:21,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:21,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:21,604 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,619 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,631 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:21,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:21,686 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:50:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:22,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:22,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2019-01-14 20:50:22,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:50:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:50:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:50:22,108 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 9 states. [2019-01-14 20:50:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:22,540 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-14 20:50:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:50:22,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-14 20:50:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:22,543 INFO L225 Difference]: With dead ends: 95 [2019-01-14 20:50:22,543 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 20:50:22,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-01-14 20:50:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 20:50:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2019-01-14 20:50:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 20:50:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-01-14 20:50:22,547 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2019-01-14 20:50:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:22,548 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-01-14 20:50:22,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:50:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-01-14 20:50:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 20:50:22,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:22,549 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:22,550 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768695, now seen corresponding path program 1 times [2019-01-14 20:50:22,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:22,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:22,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:22,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:22,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:22,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:22,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:22,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 20:50:22,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:50:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:50:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:22,772 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2019-01-14 20:50:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:22,805 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-01-14 20:50:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:50:22,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-14 20:50:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:22,808 INFO L225 Difference]: With dead ends: 100 [2019-01-14 20:50:22,808 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 20:50:22,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 20:50:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-01-14 20:50:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 20:50:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-01-14 20:50:22,812 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 63 [2019-01-14 20:50:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-01-14 20:50:22,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:50:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-01-14 20:50:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 20:50:22,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:22,814 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:22,814 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash 446605051, now seen corresponding path program 2 times [2019-01-14 20:50:22,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:22,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:22,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:22,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:22,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:22,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:22,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:22,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:22,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:22,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2019-01-14 20:50:23,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2019-01-14 20:50:23,185 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 20:50:23,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 20:50:23,352 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 20:50:23,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2019-01-14 20:50:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 20:50:23,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:23,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:23,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:23,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:23,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2019-01-14 20:50:23,755 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-14 20:50:23,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,766 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 [2019-01-14 20:50:23,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:23,783 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:23,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:23,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:23,952 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 [2019-01-14 20:50:23,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-01-14 20:50:23,962 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:24,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2019-01-14 20:50:24,124 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-14 20:50:24,280 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:50:24,435 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:50:24,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:50:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2019-01-14 20:50:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:24,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2019-01-14 20:50:24,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:25,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-14 20:50:25,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2019-01-14 20:50:25,009 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:25,039 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:25,069 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:25,101 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:25,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:25,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:25,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 20:50:25,903 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-14 20:50:26,063 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-14 20:50:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-14 20:50:26,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:26,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-01-14 20:50:26,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:50:26,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:50:26,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:50:26,643 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 7 states. [2019-01-14 20:50:27,096 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 20:50:27,593 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-14 20:50:29,711 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 116 [2019-01-14 20:50:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:29,800 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-01-14 20:50:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:50:29,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-01-14 20:50:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:29,803 INFO L225 Difference]: With dead ends: 104 [2019-01-14 20:50:29,803 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 20:50:29,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:50:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 20:50:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-01-14 20:50:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 20:50:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-14 20:50:29,810 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 68 [2019-01-14 20:50:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:29,810 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-14 20:50:29,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:50:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-14 20:50:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 20:50:29,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:29,812 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] [2019-01-14 20:50:29,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794826, now seen corresponding path program 1 times [2019-01-14 20:50:29,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:29,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:29,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:30,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:30,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:30,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:30,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:30,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:50:30,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:50:30,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:50:30,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:30,210 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 8 states. [2019-01-14 20:50:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:30,254 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-01-14 20:50:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:50:30,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-14 20:50:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:30,256 INFO L225 Difference]: With dead ends: 109 [2019-01-14 20:50:30,257 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 20:50:30,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 20:50:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-01-14 20:50:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 20:50:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-01-14 20:50:30,261 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 73 [2019-01-14 20:50:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:30,261 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-01-14 20:50:30,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:50:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-01-14 20:50:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 20:50:30,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:30,262 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] [2019-01-14 20:50:30,263 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:30,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1123262532, now seen corresponding path program 2 times [2019-01-14 20:50:30,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:30,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:30,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-14 20:50:30,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:30,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:30,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:30,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:30,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:30,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:50:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:50:30,726 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 20:50:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:50:30,863 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 20:50:30,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 20:50:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2019-01-14 20:50:30,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:30,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:30,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:30,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2019-01-14 20:50:31,149 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:50:31,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-01-14 20:50:31,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2019-01-14 20:50:31,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,312 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:31,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:31,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:50:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:50:31,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:31,537 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,555 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,574 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:31,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:31,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:31,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:50:31,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:31,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:50:31,672 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,700 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,716 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,728 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,738 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:31,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:31,769 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:50:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-14 20:50:32,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:32,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-01-14 20:50:32,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:50:32,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:50:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:50:32,075 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 11 states. [2019-01-14 20:50:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:32,422 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-14 20:50:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:50:32,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-01-14 20:50:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:32,425 INFO L225 Difference]: With dead ends: 113 [2019-01-14 20:50:32,425 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 20:50:32,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-14 20:50:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 20:50:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-01-14 20:50:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:50:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-01-14 20:50:32,430 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 78 [2019-01-14 20:50:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-01-14 20:50:32,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:50:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-01-14 20:50:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 20:50:32,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:32,433 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] [2019-01-14 20:50:32,433 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312006, now seen corresponding path program 1 times [2019-01-14 20:50:32,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:32,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-01-14 20:50:32,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:50:32,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:50:32,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:50:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:50:32,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:32,554 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 6 states. [2019-01-14 20:50:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:32,710 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-01-14 20:50:32,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:32,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-14 20:50:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:32,713 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:50:32,713 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 20:50:32,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 20:50:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 20:50:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:50:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-14 20:50:32,722 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 92 [2019-01-14 20:50:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:32,722 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-14 20:50:32,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:50:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-14 20:50:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 20:50:32,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:32,726 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] [2019-01-14 20:50:32,727 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312005, now seen corresponding path program 1 times [2019-01-14 20:50:32,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:33,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:33,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:33,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:33,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 20:50:33,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:50:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:50:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:50:33,479 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 10 states. [2019-01-14 20:50:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:33,586 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 20:50:33,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:50:33,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-01-14 20:50:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:33,589 INFO L225 Difference]: With dead ends: 117 [2019-01-14 20:50:33,589 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 20:50:33,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:50:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 20:50:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-14 20:50:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 20:50:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-14 20:50:33,595 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 92 [2019-01-14 20:50:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:33,596 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-14 20:50:33,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:50:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-14 20:50:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 20:50:33,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:33,605 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] [2019-01-14 20:50:33,605 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 283421385, now seen corresponding path program 2 times [2019-01-14 20:50:33,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:33,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:33,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:33,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:33,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:33,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:33,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:34,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:34,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:34,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:34,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-14 20:50:34,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2019-01-14 20:50:34,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 20:50:34,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:50:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2019-01-14 20:50:34,493 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-14 20:50:34,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 20:50:34,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2019-01-14 20:50:34,600 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2019-01-14 20:50:34,816 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-14 20:50:34,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2019-01-14 20:50:34,827 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:34,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-14 20:50:34,892 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:34,935 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:34,968 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:35,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-14 20:50:35,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 20:50:35,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:35,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 20:50:35,190 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:35,207 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:35,217 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:35,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:35,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:35,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:35,269 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-14 20:50:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-01-14 20:50:35,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:35,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2019-01-14 20:50:35,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 20:50:35,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 20:50:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-14 20:50:35,720 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 15 states. [2019-01-14 20:50:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:36,594 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2019-01-14 20:50:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:50:36,596 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-01-14 20:50:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:36,599 INFO L225 Difference]: With dead ends: 122 [2019-01-14 20:50:36,599 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 20:50:36,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-01-14 20:50:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 20:50:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-01-14 20:50:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 20:50:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2019-01-14 20:50:36,605 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 97 [2019-01-14 20:50:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:36,605 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2019-01-14 20:50:36,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 20:50:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2019-01-14 20:50:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 20:50:36,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:36,607 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:36,610 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash 916743349, now seen corresponding path program 1 times [2019-01-14 20:50:36,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:36,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:36,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:36,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:36,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:36,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:36,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:36,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:36,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 20:50:36,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:50:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:50:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:36,900 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 12 states. [2019-01-14 20:50:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:36,976 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-01-14 20:50:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:50:36,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-01-14 20:50:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:36,980 INFO L225 Difference]: With dead ends: 127 [2019-01-14 20:50:36,980 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 20:50:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 20:50:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-01-14 20:50:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 20:50:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-01-14 20:50:36,984 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 103 [2019-01-14 20:50:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:36,985 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-01-14 20:50:36,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:50:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-01-14 20:50:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-14 20:50:36,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:36,986 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:36,986 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120743, now seen corresponding path program 2 times [2019-01-14 20:50:36,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:36,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:36,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:36,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:36,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-14 20:50:37,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:37,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:37,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:37,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:37,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:37,601 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 42 treesize of output 41 [2019-01-14 20:50:37,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,624 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 41 treesize of output 44 [2019-01-14 20:50:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,645 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 40 treesize of output 47 [2019-01-14 20:50:37,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,669 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 43 treesize of output 50 [2019-01-14 20:50:37,771 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-14 20:50:37,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,787 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 45 treesize of output 73 [2019-01-14 20:50:37,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2019-01-14 20:50:37,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:37,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:37,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2019-01-14 20:50:37,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 67 [2019-01-14 20:50:37,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 20:50:38,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 75 [2019-01-14 20:50:38,055 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,141 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:50:38,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:50:38,383 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 41 treesize of output 44 [2019-01-14 20:50:38,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 58 [2019-01-14 20:50: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, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2019-01-14 20:50:38,453 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,474 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,496 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 20:50:38,783 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 38 treesize of output 37 [2019-01-14 20:50:38,789 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 34 treesize of output 33 [2019-01-14 20:50:38,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:38,819 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 0 case distinctions, treesize of input 30 treesize of output 54 [2019-01-14 20:50:38,828 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 0 case distinctions, treesize of input 38 treesize of output 49 [2019-01-14 20:50:38,828 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,846 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,864 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:38,882 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:39,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 20:50:39,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2019-01-14 20:50:39,300 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:42, output treesize:261 [2019-01-14 20:50:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-01-14 20:50:39,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:39,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 13 [2019-01-14 20:50:39,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:50:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:50:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:50:39,686 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 13 states. [2019-01-14 20:50:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:40,193 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-01-14 20:50:40,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:50:40,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-01-14 20:50:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:40,198 INFO L225 Difference]: With dead ends: 127 [2019-01-14 20:50:40,198 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 20:50:40,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-14 20:50:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 20:50:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-14 20:50:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 20:50:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-01-14 20:50:40,202 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 108 [2019-01-14 20:50:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:40,203 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-01-14 20:50:40,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:50:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-01-14 20:50:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-14 20:50:40,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:40,204 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] [2019-01-14 20:50:40,204 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash -184159242, now seen corresponding path program 1 times [2019-01-14 20:50:40,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:40,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:40,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:40,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:40,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:40,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:40,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:40,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 20:50:40,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:50:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:50:40,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:50:40,640 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 5 states. [2019-01-14 20:50:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:40,689 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-01-14 20:50:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:50:40,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-01-14 20:50:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:40,693 INFO L225 Difference]: With dead ends: 136 [2019-01-14 20:50:40,693 INFO L226 Difference]: Without dead ends: 136 [2019-01-14 20:50:40,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:50:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-14 20:50:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-01-14 20:50:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 20:50:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2019-01-14 20:50:40,698 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 113 [2019-01-14 20:50:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:40,698 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2019-01-14 20:50:40,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:50:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2019-01-14 20:50:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-14 20:50:40,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:40,699 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] [2019-01-14 20:50:40,700 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 57090784, now seen corresponding path program 2 times [2019-01-14 20:50:40,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:40,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-14 20:50:40,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:40,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:40,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:41,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:41,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:41,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:41,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:41,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:41,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:41,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-14 20:50:41,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2019-01-14 20:50:41,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 20:50:41,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2019-01-14 20:50:41,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-01-14 20:50:41,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2019-01-14 20:50:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-14 20:50:41,624 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2019-01-14 20:50:41,674 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,690 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2019-01-14 20:50:41,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:50:41,772 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,782 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,794 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2019-01-14 20:50:41,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 20:50:41,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:41,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:50:41,864 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,866 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,870 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,877 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,883 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:41,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:41,900 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-14 20:50:42,242 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 20:50:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-01-14 20:50:42,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:42,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 20:50:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:50:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:50:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:42,545 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 8 states. [2019-01-14 20:50:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:42,739 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2019-01-14 20:50:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:50:42,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2019-01-14 20:50:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:42,743 INFO L225 Difference]: With dead ends: 140 [2019-01-14 20:50:42,743 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 20:50:42,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:50:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 20:50:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-01-14 20:50:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-14 20:50:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2019-01-14 20:50:42,748 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 118 [2019-01-14 20:50:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:42,749 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2019-01-14 20:50:42,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:50:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2019-01-14 20:50:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-14 20:50:42,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:42,753 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] [2019-01-14 20:50:42,753 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 82106356, now seen corresponding path program 1 times [2019-01-14 20:50:42,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:42,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:42,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:50:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-01-14 20:50:43,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:50:43,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:50:43,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:50:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:50:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:50:43,017 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 6 states. [2019-01-14 20:50:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:43,109 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-14 20:50:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:43,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-01-14 20:50:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:43,112 INFO L225 Difference]: With dead ends: 135 [2019-01-14 20:50:43,112 INFO L226 Difference]: Without dead ends: 135 [2019-01-14 20:50:43,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:50:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-14 20:50:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-14 20:50:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-14 20:50:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-01-14 20:50:43,116 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 132 [2019-01-14 20:50:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:43,116 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-01-14 20:50:43,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:50:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-01-14 20:50:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-14 20:50:43,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:43,118 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] [2019-01-14 20:50:43,118 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 82106357, now seen corresponding path program 1 times [2019-01-14 20:50:43,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:43,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:43,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 20:50:43,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:43,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:50:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:43,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 20:50:43,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:50:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:50:43,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:50:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:50:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:50:43,372 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 7 states. [2019-01-14 20:50:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:43,417 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2019-01-14 20:50:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:50:43,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-01-14 20:50:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:43,420 INFO L225 Difference]: With dead ends: 144 [2019-01-14 20:50:43,420 INFO L226 Difference]: Without dead ends: 144 [2019-01-14 20:50:43,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:50:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-14 20:50:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2019-01-14 20:50:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-14 20:50:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2019-01-14 20:50:43,424 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 132 [2019-01-14 20:50:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:43,425 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2019-01-14 20:50:43,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:50:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2019-01-14 20:50:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 20:50:43,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:50:43,426 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:50:43,426 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2019-01-14 20:50:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:50:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1062657227, now seen corresponding path program 2 times [2019-01-14 20:50:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:50:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:50:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:43,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:50:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:50:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:50:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-14 20:50:43,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:50:43,646 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 [2019-01-14 20:50:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:50:43,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:50:43,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:50:43,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:50:43,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-14 20:50:43,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-14 20:50:43,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-14 20:50:43,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-14 20:50:43,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2019-01-14 20:50:43,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:43,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:43,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:43,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:43,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:43,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 20:50:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2019-01-14 20:50:43,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:43,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-01-14 20:50:43,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2019-01-14 20:50:44,080 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-14 20:50:44,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,091 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 [2019-01-14 20:50:44,091 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,167 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 [2019-01-14 20:50:44,168 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,195 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:50:44,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2019-01-14 20:50:44,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:50:44,287 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,302 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2019-01-14 20:50:44,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 20:50:44,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:50:44,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 20:50:44,393 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,397 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,403 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:50:44,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:50:44,441 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-14 20:50:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-01-14 20:50:44,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:50:44,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 20:50:44,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:50:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:50:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:50:44,858 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 12 states. [2019-01-14 20:50:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:50:45,297 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-14 20:50:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:50:45,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-01-14 20:50:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:50:45,299 INFO L225 Difference]: With dead ends: 149 [2019-01-14 20:50:45,299 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 20:50:45,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:50:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 20:50:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 20:50:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 20:50:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 20:50:45,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2019-01-14 20:50:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:50:45,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 20:50:45,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:50:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 20:50:45,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 20:50:45,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:50:45 BoogieIcfgContainer [2019-01-14 20:50:45,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:50:45,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:50:45,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:50:45,308 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:50:45,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:55" (3/4) ... [2019-01-14 20:50:45,314 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 20:50:45,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 20:50:45,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-01-14 20:50:45,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-01-14 20:50:45,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-01-14 20:50:45,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 20:50:45,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-01-14 20:50:45,329 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2019-01-14 20:50:45,329 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-14 20:50:45,330 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 20:50:45,330 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 20:50:45,376 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:50:45,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:50:45,377 INFO L168 Benchmark]: Toolchain (without parser) took 51473.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 480.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,380 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. [2019-01-14 20:50:45,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,381 INFO L168 Benchmark]: Boogie Preprocessor took 120.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,381 INFO L168 Benchmark]: RCFGBuilder took 732.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,381 INFO L168 Benchmark]: TraceAbstraction took 50183.90 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -84.9 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,382 INFO L168 Benchmark]: Witness Printer took 68.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 20:50:45,383 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 364.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 120.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 732.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50183.90 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -84.9 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. * Witness Printer took 68.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 50.1s OverallTime, 27 OverallIterations, 10 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1303 SDtfs, 1152 SDslu, 5167 SDs, 0 SdLazy, 2187 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1494 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 57 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 3354 NumberOfCodeBlocks, 2820 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3306 ConstructedInterpolants, 763 QuantifiedInterpolants, 4923963 SizeOfPredicates, 62 NumberOfNonLiveVariables, 6376 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 48 InterpolantComputations, 16 PerfectInterpolantSequences, 7001/8632 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...