./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 2e94e6aa 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-2e94e6a [2019-01-01 19:54:40,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:54:40,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:54:40,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:54:40,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:54:40,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:54:40,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:54:40,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:54:40,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:54:40,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:54:40,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:54:40,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:54:40,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:54:40,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:54:40,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:54:40,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:54:40,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:54:40,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:54:40,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:54:40,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:54:40,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:54:40,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:54:40,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:54:40,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:54:40,862 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:54:40,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:54:40,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:54:40,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:54:40,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:54:40,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:54:40,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:54:40,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:54:40,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:54:40,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:54:40,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:54:40,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:54:40,875 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:54:40,902 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:54:40,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:54:40,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:54:40,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:54:40,906 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:54:40,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:54:40,906 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:54:40,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:54:40,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:54:40,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:54:40,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:54:40,907 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:54:40,908 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:54:40,908 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:54:40,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:54:40,909 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:54:40,909 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:54:40,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:54:40,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:54:40,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:54:40,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:54:40,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:54:40,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:54:40,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:54:40,910 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:54:40,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:54:40,913 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-01 19:54:40,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:54:40,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:54:40,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:54:40,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:54:40,973 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:54:40,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-01 19:54:41,029 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fbf3048/d536d9571d664bdeb072fb17f2ad837a/FLAGe81141481 [2019-01-01 19:54:41,477 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:54:41,478 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2019-01-01 19:54:41,485 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fbf3048/d536d9571d664bdeb072fb17f2ad837a/FLAGe81141481 [2019-01-01 19:54:41,812 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fbf3048/d536d9571d664bdeb072fb17f2ad837a [2019-01-01 19:54:41,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:54:41,816 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:54:41,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:41,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:54:41,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:54:41,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:41" (1/1) ... [2019-01-01 19:54:41,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d912b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:41, skipping insertion in model container [2019-01-01 19:54:41,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:54:41" (1/1) ... [2019-01-01 19:54:41,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:54:41,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:54:42,056 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:42,082 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:54:42,114 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:54:42,147 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:54:42,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42 WrapperNode [2019-01-01 19:54:42,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:54:42,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:54:42,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:54:42,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:54:42,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (1/1) ... [2019-01-01 19:54:42,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:54:42,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:54:42,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:54:42,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:54:42,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (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-01 19:54:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-01-01 19:54:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:54:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-01-01 19:54:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:54:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 19:54:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:54:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 19:54:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:54:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:54:43,001 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:54:43,001 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 19:54:43,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:43 BoogieIcfgContainer [2019-01-01 19:54:43,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:54:43,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:54:43,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:54:43,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:54:43,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:54:41" (1/3) ... [2019-01-01 19:54:43,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcb5534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:43, skipping insertion in model container [2019-01-01 19:54:43,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:54:42" (2/3) ... [2019-01-01 19:54:43,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcb5534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:54:43, skipping insertion in model container [2019-01-01 19:54:43,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:43" (3/3) ... [2019-01-01 19:54:43,010 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2019-01-01 19:54:43,021 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:54:43,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-01 19:54:43,048 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-01 19:54:43,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:54:43,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:54:43,074 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:54:43,075 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:54:43,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:54:43,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:54:43,075 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:54:43,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:54:43,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:54:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-01 19:54:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:54:43,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:43,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:43,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-01-01 19:54:43,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:43,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:43,403 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-01 19:54:43,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:43,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:54:43,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:54:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:54:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:54:43,429 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-01 19:54:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:43,557 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-01-01 19:54:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:54:43,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:54:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:43,569 INFO L225 Difference]: With dead ends: 68 [2019-01-01 19:54:43,569 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 19:54:43,571 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-01 19:54:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 19:54:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-01 19:54:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 19:54:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-01 19:54:43,611 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-01-01 19:54:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:43,612 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-01 19:54:43,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:54:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-01 19:54:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:54:43,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:43,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:43,613 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-01-01 19:54:43,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:43,879 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 19:54:43,926 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-01 19:54:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:43,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 19:54:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:54:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:54:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:54:43,929 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-01-01 19:54:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:44,364 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-01-01 19:54:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:44,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-01 19:54:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:44,367 INFO L225 Difference]: With dead ends: 66 [2019-01-01 19:54:44,367 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 19:54:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:54:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 19:54:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-01 19:54:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 19:54:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-01 19:54:44,378 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-01-01 19:54:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:44,378 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-01 19:54:44,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:54:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-01 19:54:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:54:44,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:44,380 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:44,380 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-01-01 19:54:44,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:44,827 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 19:54:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:44,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:54:44,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:54:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:54:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:44,923 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-01-01 19:54:45,215 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 19:54:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:45,567 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-01 19:54:45,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:45,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-01 19:54:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:45,570 INFO L225 Difference]: With dead ends: 65 [2019-01-01 19:54:45,570 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 19:54:45,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 19:54:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-01 19:54:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 19:54:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-01 19:54:45,584 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-01-01 19:54:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:45,584 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-01 19:54:45,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:54:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-01 19:54:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 19:54:45,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:45,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:45,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1275227987, now seen corresponding path program 1 times [2019-01-01 19:54:45,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:45,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:54:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:54:45,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:54:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:54:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:54:45,680 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2019-01-01 19:54:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:45,883 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-01-01 19:54:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:45,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 19:54:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:45,886 INFO L225 Difference]: With dead ends: 62 [2019-01-01 19:54:45,886 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 19:54:45,886 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-01 19:54:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 19:54:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-01 19:54:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 19:54:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-01-01 19:54:45,894 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 20 [2019-01-01 19:54:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:45,894 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-01-01 19:54:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:54:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-01-01 19:54:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 19:54:45,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:45,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:45,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1275227986, now seen corresponding path program 1 times [2019-01-01 19:54:45,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:45,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:45,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:45,985 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-01 19:54:46,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:46,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:46,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:46,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 19:54:46,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:54:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:54:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:46,126 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-01-01 19:54:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:46,169 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-01-01 19:54:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:54:46,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 19:54:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:46,171 INFO L225 Difference]: With dead ends: 67 [2019-01-01 19:54:46,171 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 19:54:46,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:54:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 19:54:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-01 19:54:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 19:54:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-01 19:54:46,178 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2019-01-01 19:54:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:46,179 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-01 19:54:46,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:54:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-01 19:54:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 19:54:46,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:46,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:46,180 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 2 times [2019-01-01 19:54:46,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:46,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:54:46,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:46,259 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-01 19:54:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:46,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:46,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:46,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:46,371 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-01 19:54:46,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,478 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-01 19:54:46,708 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 19:54:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,757 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-01 19:54:46,926 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-01 19:54:46,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:46,968 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-01 19:54:47,146 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 19:54:47,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,193 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-01 19:54:47,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:47,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,297 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-01 19:54:47,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:47,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,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, 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-01 19:54:47,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,612 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-01 19:54:47,613 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:47,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:47,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:47,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,736 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-01 19:54:47,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:47,840 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-01 19:54:48,027 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-01 19:54:48,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,047 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-01 19:54:48,048 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,067 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,090 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,322 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-01 19:54:48,328 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-01 19:54:48,334 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-01 19:54:48,340 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-01 19:54:48,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:48,358 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-01 19:54:48,359 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,391 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,407 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,419 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,456 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:48,499 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-01 19:54:48,500 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-01 19:54:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:54:48,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:48,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2019-01-01 19:54:48,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:54:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:54:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:54:48,965 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-01-01 19:54:49,218 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 19:54:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:49,685 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-01-01 19:54:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:54:49,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-01 19:54:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:49,690 INFO L225 Difference]: With dead ends: 70 [2019-01-01 19:54:49,690 INFO L226 Difference]: Without dead ends: 70 [2019-01-01 19:54:49,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:54:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-01 19:54:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-01-01 19:54:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 19:54:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-01-01 19:54:49,696 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-01-01 19:54:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:49,697 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-01-01 19:54:49,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:54:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-01-01 19:54:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 19:54:49,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:49,698 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:49,698 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:49,699 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-01-01 19:54:49,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:49,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:49,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:49,795 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-01 19:54:49,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:49,796 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-01 19:54:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:49,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:49,947 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-01 19:54:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 19:54:49,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:54:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:54:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:49,982 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-01-01 19:54:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:50,234 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-01-01 19:54:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:54:50,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-01 19:54:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:50,237 INFO L225 Difference]: With dead ends: 73 [2019-01-01 19:54:50,237 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 19:54:50,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:54:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 19:54:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-01 19:54:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 19:54:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-01 19:54:50,251 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 27 [2019-01-01 19:54:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:50,251 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-01 19:54:50,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:54:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-01 19:54:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:54:50,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:50,256 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:54:50,256 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 2 times [2019-01-01 19:54:50,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:50,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:50,543 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-01 19:54:50,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:50,544 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-01 19:54:50,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:50,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:50,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:50,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:50,614 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-01 19:54:50,806 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:54:50,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:50,838 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-01 19:54:51,037 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 19:54:51,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,044 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-01 19:54:51,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,106 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-01 19:54:51,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,198 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-01 19:54:51,208 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-01 19:54:51,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:51,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:51,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:51,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:51,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,395 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-01 19:54:51,517 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-01 19:54:51,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 85 [2019-01-01 19:54:51,887 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-01 19:54:51,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:51,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 99 [2019-01-01 19:54:51,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-01-01 19:54:51,950 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:52,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,089 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-01 19:54:52,091 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-01 19:54:52,253 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:54:52,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:52,578 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-01 19:54:52,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 85 [2019-01-01 19:54:52,600 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-01 19:54:52,601 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:52,646 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:52,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:54:53,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2019-01-01 19:54:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:53,148 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-01 19:54:53,153 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-01 19:54:53,154 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:53,185 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:53,352 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:53,537 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:54:53,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:54:53,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:54:54,234 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-01 19:54:54,234 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-01 19:54:54,484 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-01 19:54:54,669 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-01 19:54:54,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:54:54,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-01-01 19:54:54,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:54:54,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:54:54,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:54:54,700 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2019-01-01 19:54:55,027 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-01 19:54:57,122 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-01 19:54:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:57,546 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-01 19:54:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:54:57,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-01 19:54:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:57,549 INFO L225 Difference]: With dead ends: 75 [2019-01-01 19:54:57,550 INFO L226 Difference]: Without dead ends: 75 [2019-01-01 19:54:57,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:54:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-01 19:54:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-01 19:54:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 19:54:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-01-01 19:54:57,556 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2019-01-01 19:54:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:57,556 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-01-01 19:54:57,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:54:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-01-01 19:54:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 19:54:57,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:57,557 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-01 19:54:57,557 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 532455403, now seen corresponding path program 1 times [2019-01-01 19:54:57,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:57,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:54:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:57,707 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-01 19:54:57,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:57,708 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-01 19:54:57,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:57,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:57,796 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-01 19:54:57,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:54:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 19:54:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:54:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:54:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:54:57,829 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2019-01-01 19:54:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:54:58,010 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-01 19:54:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:54:58,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-01 19:54:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:54:58,012 INFO L225 Difference]: With dead ends: 78 [2019-01-01 19:54:58,012 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 19:54:58,013 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-01 19:54:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 19:54:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-01-01 19:54:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-01 19:54:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-01-01 19:54:58,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2019-01-01 19:54:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:54:58,026 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-01-01 19:54:58,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:54:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-01-01 19:54:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:54:58,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:54:58,031 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-01 19:54:58,031 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:54:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:54:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash -428261788, now seen corresponding path program 2 times [2019-01-01 19:54:58,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:54:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:54:58,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:58,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:54:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:54:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:54:58,281 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-01 19:54:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:54:58,281 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-01 19:54:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:54:58,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:54:58,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:54:58,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:54:58,346 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-01 19:54:58,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,448 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-01 19:54:58,574 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 19:54:58,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2019-01-01 19:54:58,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2019-01-01 19:54:58,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,718 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-01 19:54:58,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:58,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:58,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:58,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,843 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-01 19:54:58,958 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-01 19:54:58,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:58,986 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-01 19:54:59,268 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 19:54:59,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,305 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-01 19:54:59,306 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,445 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-01 19:54:59,448 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,511 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:54:59,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,582 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-01 19:54:59,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,639 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-01 19:54:59,640 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,666 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,705 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,788 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-01 19:54:59,793 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-01 19:54:59,796 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-01 19:54:59,811 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-01 19:54:59,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:54:59,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, 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-01 19:54:59,820 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,850 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,865 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,916 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,956 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:54:59,989 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-01 19:54:59,990 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-01 19:55:00,283 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-01 19:55:00,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:00,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-01-01 19:55:00,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:55:00,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:55:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:55:00,304 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 12 states. [2019-01-01 19:55:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:00,805 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-01-01 19:55:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:55:00,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-01-01 19:55:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:00,808 INFO L225 Difference]: With dead ends: 80 [2019-01-01 19:55:00,809 INFO L226 Difference]: Without dead ends: 80 [2019-01-01 19:55:00,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:55:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-01 19:55:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-01 19:55:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 19:55:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-01-01 19:55:00,816 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 36 [2019-01-01 19:55:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:00,816 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-01-01 19:55:00,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:55:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-01-01 19:55:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:55:00,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:00,821 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:00,821 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 997106845, now seen corresponding path program 1 times [2019-01-01 19:55:00,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:00,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:00,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-01 19:55:00,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:55:00,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:55:00,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:55:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:55:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:55:00,968 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2019-01-01 19:55:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:01,073 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-01 19:55:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:55:01,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-01 19:55:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:01,076 INFO L225 Difference]: With dead ends: 77 [2019-01-01 19:55:01,077 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 19:55:01,077 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-01 19:55:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 19:55:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-01 19:55:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:55:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-01 19:55:01,082 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2019-01-01 19:55:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:01,083 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-01 19:55:01,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:55:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-01 19:55:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:55:01,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:01,084 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:01,084 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 997106846, now seen corresponding path program 1 times [2019-01-01 19:55:01,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:55:01,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:01,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 19:55:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:01,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:55:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:01,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 19:55:01,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:55:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:55:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:55:01,426 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2019-01-01 19:55:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:01,476 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-01 19:55:01,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:55:01,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-01-01 19:55:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:01,478 INFO L225 Difference]: With dead ends: 82 [2019-01-01 19:55:01,478 INFO L226 Difference]: Without dead ends: 82 [2019-01-01 19:55:01,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:55:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-01 19:55:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-01 19:55:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 19:55:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-01-01 19:55:01,483 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 48 [2019-01-01 19:55:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:01,483 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-01-01 19:55:01,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:55:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-01-01 19:55:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 19:55:01,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:01,486 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:01,486 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834181, now seen corresponding path program 2 times [2019-01-01 19:55:01,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:55:01,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:01,675 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-01 19:55:01,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:01,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:01,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:01,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:01,723 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-01 19:55:01,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,727 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-01 19:55:01,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,738 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-01 19:55:01,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,750 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-01 19:55:01,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,763 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-01 19:55:01,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:01,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:01,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:01,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:01,869 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-01 19:55:01,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2019-01-01 19:55:01,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:01,998 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-01 19:55:02,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,124 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-01 19:55:02,273 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 19:55:02,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,290 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-01 19:55:02,291 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,364 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-01 19:55:02,365 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,458 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:55:02,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,513 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-01 19:55:02,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,570 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-01 19:55:02,571 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,591 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,653 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-01 19:55:02,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,731 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-01 19:55:02,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:02,784 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-01 19:55:02,785 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,799 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,811 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,830 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:02,867 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-01 19:55:02,867 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-01 19:55:03,292 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 19:55:03,603 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 19:55:03,957 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 19:55:04,346 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 19:55:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-01 19:55:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:04,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-01-01 19:55:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 19:55:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 19:55:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:55:04,437 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 16 states. [2019-01-01 19:55:04,930 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 19:55:05,315 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:05,626 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:05,955 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:06,291 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 19:55:06,652 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:07,047 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:07,693 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-01-01 19:55:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 19:55:07,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-01-01 19:55:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:07,696 INFO L225 Difference]: With dead ends: 85 [2019-01-01 19:55:07,696 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 19:55:07,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2019-01-01 19:55:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 19:55:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-01-01 19:55:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 19:55:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-01 19:55:07,701 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2019-01-01 19:55:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:07,701 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-01 19:55:07,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 19:55:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-01 19:55:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 19:55:07,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:07,702 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:07,702 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1040281730, now seen corresponding path program 1 times [2019-01-01 19:55:07,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:07,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:07,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:07,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:07,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:07,854 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-01 19:55:07,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:07,855 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-01 19:55:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:07,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:07,919 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-01 19:55:07,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:07,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-01 19:55:07,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:55:07,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:55:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:07,940 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2019-01-01 19:55:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:08,021 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-01-01 19:55:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:55:08,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-01-01 19:55:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:08,023 INFO L225 Difference]: With dead ends: 86 [2019-01-01 19:55:08,023 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 19:55:08,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 19:55:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-01 19:55:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-01 19:55:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-01-01 19:55:08,027 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 55 [2019-01-01 19:55:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:08,027 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-01-01 19:55:08,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:55:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-01-01 19:55:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:55:08,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:08,031 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:08,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163333, now seen corresponding path program 2 times [2019-01-01 19:55:08,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:08,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:08,179 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-01 19:55:08,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:08,180 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-01 19:55:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:08,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:08,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:08,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:08,254 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-01 19:55:08,454 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:55:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:08,662 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-01 19:55:08,884 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 19:55:08,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:08,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:08,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:08,913 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-01 19:55:09,085 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-01 19:55:09,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,098 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-01 19:55:09,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,212 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-01 19:55:09,216 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-01 19:55:09,217 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:09,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:09,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,378 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-01 19:55:09,541 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-01 19:55:09,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 99 [2019-01-01 19:55:09,582 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-01 19:55:09,583 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:09,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:09,975 INFO L303 Elim1Store]: Index analysis took 282 ms [2019-01-01 19:55:10,011 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-01 19:55:10,012 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-01 19:55:10,164 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:55:10,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:10,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 85 [2019-01-01 19:55:10,376 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-01 19:55:10,376 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:10,492 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:10,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:55:10,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:55:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,128 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-01 19:55:11,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,187 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-01 19:55:11,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:11,254 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-01 19:55:11,259 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-01 19:55:11,259 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:11,319 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:11,367 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:11,399 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:11,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:55:11,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:55:12,059 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-01 19:55:12,060 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2019-01-01 19:55:13,033 WARN L181 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2019-01-01 19:55:13,503 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-01 19:55:13,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-01 19:55:13,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:55:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:55:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:55:13,542 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2019-01-01 19:55:14,065 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-01 19:55:14,303 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-01 19:55:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:14,374 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-01 19:55:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:55:14,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-01 19:55:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:14,377 INFO L225 Difference]: With dead ends: 94 [2019-01-01 19:55:14,377 INFO L226 Difference]: Without dead ends: 94 [2019-01-01 19:55:14,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:55:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-01 19:55:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-01-01 19:55:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 19:55:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-01-01 19:55:14,381 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 58 [2019-01-01 19:55:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:14,382 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-01-01 19:55:14,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:55:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-01-01 19:55:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 19:55:14,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:14,385 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-01 19:55:14,385 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768694, now seen corresponding path program 1 times [2019-01-01 19:55:14,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:14,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:14,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:14,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:14,499 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-01 19:55:14,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:14,500 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-01 19:55:14,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:14,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:14,577 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-01 19:55:14,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:14,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 19:55:14,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:55:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:55:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:55:14,600 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 6 states. [2019-01-01 19:55:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:14,683 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-01 19:55:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:55:14,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-01 19:55:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:14,687 INFO L225 Difference]: With dead ends: 99 [2019-01-01 19:55:14,687 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 19:55:14,687 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-01 19:55:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 19:55:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-01-01 19:55:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 19:55:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-01 19:55:14,691 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2019-01-01 19:55:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-01 19:55:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:55:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-01 19:55:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 19:55:14,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:14,693 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-01 19:55:14,693 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash 446605052, now seen corresponding path program 2 times [2019-01-01 19:55:14,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:14,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:14,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:14,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:14,827 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-01 19:55:14,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:14,828 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-01 19:55:14,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:14,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:14,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:14,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:14,873 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-01 19:55:14,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,877 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-01 19:55:14,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,885 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-01 19:55:14,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,894 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-01 19:55:14,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:14,907 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-01 19:55:14,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:14,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:14,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:14,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:14,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:15,009 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-01 19:55:15,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,038 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-01 19:55:15,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,130 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-01 19:55:15,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,234 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-01 19:55:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,297 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-01 19:55:15,298 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:15,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:15,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:15,403 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-01 19:55:16,122 WARN L181 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 19:55:16,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,152 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-01 19:55:16,154 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,247 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-01 19:55:16,247 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,272 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,304 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:55:16,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2019-01-01 19:55:16,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,416 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-01 19:55:16,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:16,476 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-01 19:55:16,476 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,489 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,499 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:16,553 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-01 19:55:16,553 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-01 19:55:16,776 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-01 19:55:16,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:16,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-01 19:55:16,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:55:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:55:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:55:16,806 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 9 states. [2019-01-01 19:55:17,201 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 19:55:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:17,400 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-01-01 19:55:17,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:55:17,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-01-01 19:55:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:17,403 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:55:17,404 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:55:17,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:17,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:55:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-01 19:55:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:55:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-01-01 19:55:17,408 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 68 [2019-01-01 19:55:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:17,409 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-01-01 19:55:17,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:55:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-01-01 19:55:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 19:55:17,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:17,410 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:17,410 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 417204474, now seen corresponding path program 1 times [2019-01-01 19:55:17,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:17,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:17,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-01-01 19:55:17,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:55:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:55:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:55:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:55:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:55:17,541 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 6 states. [2019-01-01 19:55:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:17,639 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-01-01 19:55:17,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:55:17,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-01 19:55:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:17,642 INFO L225 Difference]: With dead ends: 98 [2019-01-01 19:55:17,643 INFO L226 Difference]: Without dead ends: 98 [2019-01-01 19:55:17,643 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-01 19:55:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-01 19:55:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-01 19:55:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-01 19:55:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-01-01 19:55:17,647 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 82 [2019-01-01 19:55:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:17,647 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-01-01 19:55:17,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:55:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-01-01 19:55:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 19:55:17,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:17,648 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:17,648 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 417204475, now seen corresponding path program 1 times [2019-01-01 19:55:17,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:17,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:17,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-01 19:55:17,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:17,797 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-01 19:55:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-01 19:55:17,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:17,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:55:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 19:55:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 19:55:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:55:17,903 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 8 states. [2019-01-01 19:55:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:17,946 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-01 19:55:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:55:17,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-01 19:55:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:17,949 INFO L225 Difference]: With dead ends: 107 [2019-01-01 19:55:17,949 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 19:55:17,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:55:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 19:55:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-01-01 19:55:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:55:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-01-01 19:55:17,955 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 82 [2019-01-01 19:55:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:17,955 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-01-01 19:55:17,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 19:55:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-01-01 19:55:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-01 19:55:17,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:17,960 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:17,960 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057847, now seen corresponding path program 2 times [2019-01-01 19:55:17,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-01 19:55:18,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:18,265 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-01 19:55:18,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:18,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:18,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:18,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:18,325 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-01 19:55:18,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,367 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-01 19:55:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,486 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-01 19:55:18,620 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-01-01 19:55:18,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,631 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-01 19:55:18,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,686 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-01 19:55:18,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:18,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:18,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,779 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-01 19:55:18,899 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 19:55:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,921 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-01 19:55:18,921 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:18,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:18,991 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-01 19:55:18,993 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:55:19,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:55:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,178 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-01 19:55:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,224 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-01 19:55:19,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,282 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-01 19:55:19,283 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,300 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,320 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,402 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-01 19:55:19,406 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-01 19:55:19,408 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-01 19:55:19,412 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-01 19:55:19,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:19,417 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-01 19:55:19,418 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,456 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,472 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,485 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,496 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:19,549 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-01 19:55:19,549 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-01-01 19:55:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-01-01 19:55:19,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:19,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-01 19:55:19,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:55:19,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:55:19,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:55:19,925 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 13 states. [2019-01-01 19:55:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:20,630 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-01-01 19:55:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:55:20,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-01-01 19:55:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:20,633 INFO L225 Difference]: With dead ends: 112 [2019-01-01 19:55:20,633 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:55:20,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:55:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:55:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-01-01 19:55:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:55:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-01-01 19:55:20,637 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 87 [2019-01-01 19:55:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:20,637 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-01-01 19:55:20,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:55:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-01-01 19:55:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 19:55:20,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:20,639 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:20,639 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1649097355, now seen corresponding path program 1 times [2019-01-01 19:55:20,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:20,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:20,873 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-01 19:55:20,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:20,874 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-01 19:55:20,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:20,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:20,974 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-01 19:55:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:20,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 19:55:20,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:55:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:55:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:55:20,993 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 10 states. [2019-01-01 19:55:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:21,163 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-01 19:55:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:55:21,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-01 19:55:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:21,169 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:55:21,169 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 19:55:21,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:55:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 19:55:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-01 19:55:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 19:55:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-01 19:55:21,172 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 93 [2019-01-01 19:55:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:21,172 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-01 19:55:21,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:55:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-01 19:55:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-01 19:55:21,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:21,175 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:21,175 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:21,175 INFO L82 PathProgramCache]: Analyzing trace with hash 196128295, now seen corresponding path program 2 times [2019-01-01 19:55:21,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:21,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:21,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:22,061 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-01 19:55:22,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:22,062 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-01 19:55:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:22,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:22,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:22,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:22,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-01 19:55:22,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2019-01-01 19:55:22,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-01 19:55:22,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-01 19:55:22,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-01 19:55:22,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-01 19:55:22,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2019-01-01 19:55:22,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-01 19:55:22,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-01 19:55:22,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-01 19:55:22,328 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,338 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,351 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2019-01-01 19:55:22,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2019-01-01 19:55:22,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2019-01-01 19:55:22,418 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,433 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2019-01-01 19:55:22,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:22,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2019-01-01 19:55:22,513 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-01 19:55:22,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2019-01-01 19:55:22,599 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:22,664 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:55:22,738 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:55:22,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 19:55:22,902 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:55:22,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-01 19:55:23,058 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-01 19:55:23,058 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2019-01-01 19:55:23,150 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-01 19:55:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:23,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2019-01-01 19:55:23,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:55:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:55:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:55:23,170 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2019-01-01 19:55:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:23,479 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-01-01 19:55:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:55:23,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-01-01 19:55:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:23,483 INFO L225 Difference]: With dead ends: 121 [2019-01-01 19:55:23,484 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 19:55:23,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:55:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 19:55:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-01 19:55:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 19:55:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-01-01 19:55:23,488 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 98 [2019-01-01 19:55:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:23,488 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-01-01 19:55:23,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:55:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-01-01 19:55:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-01 19:55:23,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:23,493 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-01 19:55:23,493 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 916743350, now seen corresponding path program 1 times [2019-01-01 19:55:23,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:23,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:23,620 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-01 19:55:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:23,621 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-01 19:55:23,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:23,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:23,714 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-01 19:55:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 19:55:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:55:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:55:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:55:23,744 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 12 states. [2019-01-01 19:55:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:23,925 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-01 19:55:23,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 19:55:23,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-01-01 19:55:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:23,928 INFO L225 Difference]: With dead ends: 126 [2019-01-01 19:55:23,928 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 19:55:23,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:55:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 19:55:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-01-01 19:55:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 19:55:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-01-01 19:55:23,938 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 103 [2019-01-01 19:55:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:23,938 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-01-01 19:55:23,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:55:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-01-01 19:55:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-01 19:55:23,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:23,942 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-01 19:55:23,942 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120744, now seen corresponding path program 2 times [2019-01-01 19:55:23,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:24,577 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-01 19:55:24,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:24,577 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-01 19:55:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:24,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:24,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:24,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:24,629 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-01 19:55:24,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,635 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-01 19:55:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,643 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-01 19:55:24,733 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-01 19:55:24,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,746 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-01 19:55:24,747 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,769 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,830 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-01 19:55:24,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,857 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-01 19:55:24,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2019-01-01 19:55:24,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2019-01-01 19:55:24,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:24,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-01 19:55:24,977 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,981 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:24,988 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,032 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-01 19:55:25,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2019-01-01 19:55:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-01 19:55:25,083 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,117 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2019-01-01 19:55:25,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,317 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-01 19:55:25,317 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:25,368 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-01 19:55:25,371 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,397 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,416 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:55:25,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,453 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:25,472 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-01 19:55:25,473 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-01 19:55:25,923 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 19:55:26,105 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-01 19:55:26,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:26,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2019-01-01 19:55:26,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 19:55:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 19:55:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-01 19:55:26,124 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 15 states. [2019-01-01 19:55:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:26,753 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2019-01-01 19:55:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:55:26,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-01-01 19:55:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:26,756 INFO L225 Difference]: With dead ends: 126 [2019-01-01 19:55:26,756 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 19:55:26,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-01-01 19:55:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 19:55:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-01 19:55:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:55:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2019-01-01 19:55:26,760 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 108 [2019-01-01 19:55:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:26,760 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2019-01-01 19:55:26,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 19:55:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2019-01-01 19:55:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-01 19:55:26,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:26,761 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:26,762 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1737944524, now seen corresponding path program 1 times [2019-01-01 19:55:26,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:26,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:26,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:26,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:55:26,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-01 19:55:26,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:55:26,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:55:26,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:55:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:55:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:55:26,987 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 6 states. [2019-01-01 19:55:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:27,072 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-01 19:55:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:55:27,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-01-01 19:55:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:27,076 INFO L225 Difference]: With dead ends: 125 [2019-01-01 19:55:27,076 INFO L226 Difference]: Without dead ends: 125 [2019-01-01 19:55:27,076 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-01 19:55:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-01 19:55:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-01 19:55:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 19:55:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-01-01 19:55:27,081 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 122 [2019-01-01 19:55:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:27,085 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-01-01 19:55:27,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:55:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-01-01 19:55:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-01 19:55:27,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:27,086 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:27,086 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1737944523, now seen corresponding path program 1 times [2019-01-01 19:55:27,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-01 19:55:27,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:27,249 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-01 19:55:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:27,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-01 19:55:27,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:55:27,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 19:55:27,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:55:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:55:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:55:27,376 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 5 states. [2019-01-01 19:55:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:27,397 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2019-01-01 19:55:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:55:27,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-01-01 19:55:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:27,408 INFO L225 Difference]: With dead ends: 134 [2019-01-01 19:55:27,408 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 19:55:27,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:55:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 19:55:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-01-01 19:55:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-01 19:55:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2019-01-01 19:55:27,418 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 122 [2019-01-01 19:55:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:27,419 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2019-01-01 19:55:27,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:55:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2019-01-01 19:55:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-01 19:55:27,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:55:27,424 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:55:27,424 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-01 19:55:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:55:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212021, now seen corresponding path program 2 times [2019-01-01 19:55:27,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:55:27,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:55:27,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:27,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:55:27,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:55:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:55:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-01-01 19:55:27,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:55:27,612 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-01 19:55:27,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:55:27,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:55:27,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:55:27,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:55:27,701 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-01 19:55:27,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,744 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-01 19:55:27,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,796 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-01 19:55:27,806 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-01 19:55:27,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,821 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-01 19:55:27,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:27,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:27,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:27,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:27,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:27,911 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-01 19:55:27,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:27,955 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-01 19:55:28,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,036 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-01 19:55:28,080 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-01 19:55:28,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,192 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-01 19:55:28,193 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,244 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-01 19:55:28,244 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,263 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,308 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-01 19:55:28,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,352 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-01 19:55:28,353 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,367 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,381 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,410 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-01 19:55:28,445 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-01 19:55:28,590 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 19:55:28,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:55:28,602 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-01 19:55:28,602 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,604 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,610 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,627 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:55:28,647 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-01 19:55:28,647 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-01-01 19:55:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-01-01 19:55:29,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:55:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2019-01-01 19:55:29,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:55:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:55:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:55:29,114 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 10 states. [2019-01-01 19:55:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:55:29,419 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2019-01-01 19:55:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:55:29,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-01-01 19:55:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:55:29,420 INFO L225 Difference]: With dead ends: 139 [2019-01-01 19:55:29,420 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:55:29,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:55:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:55:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:55:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:55:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:55:29,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-01-01 19:55:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:55:29,422 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:55:29,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:55:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:55:29,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:55:29,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:55:29 BoogieIcfgContainer [2019-01-01 19:55:29,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:55:29,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:55:29,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:55:29,429 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:55:29,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:54:43" (3/4) ... [2019-01-01 19:55:29,434 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:55:29,441 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:55:29,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-01-01 19:55:29,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-01-01 19:55:29,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-01-01 19:55:29,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:55:29,442 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-01-01 19:55:29,449 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-01-01 19:55:29,449 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-01 19:55:29,449 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 19:55:29,450 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:55:29,503 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:55:29,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:55:29,504 INFO L168 Benchmark]: Toolchain (without parser) took 47688.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 401.6 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -321.7 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,505 INFO L168 Benchmark]: CDTParser took 0.15 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-01 19:55:29,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,505 INFO L168 Benchmark]: Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,506 INFO L168 Benchmark]: RCFGBuilder took 798.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -99.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,506 INFO L168 Benchmark]: TraceAbstraction took 46425.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -239.0 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,506 INFO L168 Benchmark]: Witness Printer took 74.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 214.4 kB). Peak memory consumption was 214.4 kB. Max. memory is 11.5 GB. [2019-01-01 19:55:29,508 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.15 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 330.74 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 798.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -99.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46425.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -239.0 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 214.4 kB). Peak memory consumption was 214.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 46.3s OverallTime, 27 OverallIterations, 10 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1304 SDtfs, 1103 SDslu, 4887 SDs, 0 SdLazy, 2283 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1575 GetRequests, 1317 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 55 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 2975 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2928 ConstructedInterpolants, 570 QuantifiedInterpolants, 3440629 SizeOfPredicates, 58 NumberOfNonLiveVariables, 4391 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 5340/6904 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...