./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.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 e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:01:59,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:01:59,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:01:59,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:01:59,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:01:59,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:01:59,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:01:59,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:01:59,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:01:59,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:01:59,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:01:59,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:01:59,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:01:59,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:01:59,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:01:59,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:01:59,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:01:59,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:01:59,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:01:59,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:01:59,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:01:59,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:01:59,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:01:59,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:01:59,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:01:59,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:01:59,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:01:59,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:01:59,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:01:59,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:01:59,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:01:59,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:01:59,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:01:59,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:01:59,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:01:59,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:01:59,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:01:59,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:01:59,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:01:59,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:01:59,271 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:01:59,271 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:01:59,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:01:59,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:01:59,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:01:59,275 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:01:59,276 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:01:59,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:01:59,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:01:59,276 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:01:59,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:01:59,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:01:59,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:01:59,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:01:59,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:01:59,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:01:59,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:01:59,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:01:59,280 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:01:59,281 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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2018-11-28 23:01:59,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:01:59,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:01:59,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:01:59,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:01:59,356 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:01:59,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-28 23:01:59,427 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04cd034/afadc643ee584d2eb31eb8d4cc92c6e3/FLAG0423785cf [2018-11-28 23:01:59,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:01:59,854 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-28 23:01:59,861 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04cd034/afadc643ee584d2eb31eb8d4cc92c6e3/FLAG0423785cf [2018-11-28 23:02:00,235 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04cd034/afadc643ee584d2eb31eb8d4cc92c6e3 [2018-11-28 23:02:00,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:00,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:00,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:00,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:00,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:00,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f0bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00, skipping insertion in model container [2018-11-28 23:02:00,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:00,282 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:00,453 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:00,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:00,489 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:00,508 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:00,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00 WrapperNode [2018-11-28 23:02:00,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:00,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:00,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:00,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:00,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... [2018-11-28 23:02:00,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:00,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:00,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:00,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:00,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-28 23:02:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-28 23:02:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:01,131 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:01,132 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 23:02:01,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:01 BoogieIcfgContainer [2018-11-28 23:02:01,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:01,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:01,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:01,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:00" (1/3) ... [2018-11-28 23:02:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44c9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:01, skipping insertion in model container [2018-11-28 23:02:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:00" (2/3) ... [2018-11-28 23:02:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44c9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:01, skipping insertion in model container [2018-11-28 23:02:01,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:01" (3/3) ... [2018-11-28 23:02:01,141 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2018-11-28 23:02:01,150 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:01,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-28 23:02:01,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-28 23:02:01,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:01,199 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:01,199 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:01,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:01,200 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:01,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:01,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:01,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:01,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-28 23:02:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:02:01,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:01,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:01,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:01,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2018-11-28 23:02:01,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:01,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:01,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:01,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:01,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:01,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:01,608 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-11-28 23:02:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,075 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-28 23:02:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:02,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 23:02:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,089 INFO L225 Difference]: With dead ends: 43 [2018-11-28 23:02:02,089 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 23:02:02,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 23:02:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-28 23:02:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:02:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-28 23:02:02,134 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2018-11-28 23:02:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-28 23:02:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-28 23:02:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:02:02,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:02,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2018-11-28 23:02:02,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:02,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:02,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:02,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,242 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2018-11-28 23:02:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,443 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-28 23:02:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:02,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 23:02:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,445 INFO L225 Difference]: With dead ends: 37 [2018-11-28 23:02:02,445 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 23:02:02,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 23:02:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-28 23:02:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 23:02:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-28 23:02:02,452 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2018-11-28 23:02:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,452 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-28 23:02:02,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-28 23:02:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:02:02,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,453 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:02,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2018-11-28 23:02:02,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:02,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:02,866 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:02,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:02,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:02,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:02:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:03,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:03,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 23:02:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:03,060 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 5 states. [2018-11-28 23:02:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:03,266 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-28 23:02:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:03,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 23:02:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:03,270 INFO L225 Difference]: With dead ends: 41 [2018-11-28 23:02:03,270 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 23:02:03,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 23:02:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-28 23:02:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:02:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-28 23:02:03,277 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 13 [2018-11-28 23:02:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:03,277 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-28 23:02:03,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-28 23:02:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 23:02:03,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:03,278 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:03,279 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:03,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash 479651539, now seen corresponding path program 2 times [2018-11-28 23:02:03,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:03,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,031 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-28 23:02:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:02:04,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:04,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:04,035 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2018-11-28 23:02:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:04,203 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-28 23:02:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:04,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 23:02:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:04,206 INFO L225 Difference]: With dead ends: 39 [2018-11-28 23:02:04,206 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 23:02:04,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 23:02:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 23:02:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:02:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-28 23:02:04,214 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 16 [2018-11-28 23:02:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:04,214 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-28 23:02:04,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-28 23:02:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:02:04,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:04,215 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:04,215 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:04,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash -680983352, now seen corresponding path program 1 times [2018-11-28 23:02:04,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:04,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:04,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:04,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:04,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:04,388 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 6 states. [2018-11-28 23:02:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:04,436 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-28 23:02:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:04,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:02:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:04,439 INFO L225 Difference]: With dead ends: 43 [2018-11-28 23:02:04,440 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 23:02:04,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 23:02:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-28 23:02:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 23:02:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-28 23:02:04,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 21 [2018-11-28 23:02:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-28 23:02:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-28 23:02:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 23:02:04,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:04,447 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:04,447 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:04,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 2 times [2018-11-28 23:02:04,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:04,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:04,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:04,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:04,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:04,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:04,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:04,575 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 9 treesize of output 12 [2018-11-28 23:02:04,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:04,654 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 23:02:04,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:04,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:04,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:04,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-11-28 23:02:04,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:04,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:04,859 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-28 23:02:04,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:05,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:05,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:05,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:05,061 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-11-28 23:02:05,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:05,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 23:02:05,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2018-11-28 23:02:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:02:05,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-11-28 23:02:05,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:05,244 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2018-11-28 23:02:05,748 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2018-11-28 23:02:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:05,826 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-28 23:02:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:05,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 23:02:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:05,829 INFO L225 Difference]: With dead ends: 45 [2018-11-28 23:02:05,829 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 23:02:05,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:02:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 23:02:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-28 23:02:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 23:02:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-28 23:02:05,835 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2018-11-28 23:02:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-28 23:02:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-28 23:02:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 23:02:05,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,837 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,837 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:05,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381225, now seen corresponding path program 1 times [2018-11-28 23:02:05,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:05,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:05,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:05,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:02:06,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:06,087 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 8 states. [2018-11-28 23:02:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,134 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-28 23:02:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:06,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-28 23:02:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,141 INFO L225 Difference]: With dead ends: 48 [2018-11-28 23:02:06,141 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 23:02:06,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 23:02:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-28 23:02:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:02:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-28 23:02:06,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-11-28 23:02:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,150 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-28 23:02:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-28 23:02:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:02:06,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,153 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:06,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 2 times [2018-11-28 23:02:06,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:06,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:06,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:06,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:06,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:06,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:06,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:06,441 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 9 treesize of output 12 [2018-11-28 23:02:06,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:06,645 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 23:02:06,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:02:06,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:06,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:02:06,777 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2018-11-28 23:02:06,998 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 23:02:07,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,103 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-11-28 23:02:07,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:07,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,153 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-11-28 23:02:07,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:07,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 23:02:07,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:07,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:07,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 23:02:07,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:07,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:02:07,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2018-11-28 23:02:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-28 23:02:07,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:07,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-11-28 23:02:07,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:07,428 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2018-11-28 23:02:07,688 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:02:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,451 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-28 23:02:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 23:02:08,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-28 23:02:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,454 INFO L225 Difference]: With dead ends: 51 [2018-11-28 23:02:08,455 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 23:02:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:02:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 23:02:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 23:02:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 23:02:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-28 23:02:08,460 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2018-11-28 23:02:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,460 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-28 23:02:08,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-28 23:02:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:02:08,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,462 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,462 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:08,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 432910569, now seen corresponding path program 1 times [2018-11-28 23:02:08,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-28 23:02:08,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:08,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:08,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:08,551 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 3 states. [2018-11-28 23:02:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,635 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-28 23:02:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:08,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 23:02:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,638 INFO L225 Difference]: With dead ends: 48 [2018-11-28 23:02:08,638 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 23:02:08,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 23:02:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 23:02:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 23:02:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-28 23:02:08,643 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 34 [2018-11-28 23:02:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,643 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-28 23:02:08,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-28 23:02:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:02:08,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,644 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:08,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash 432910570, now seen corresponding path program 1 times [2018-11-28 23:02:08,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:08,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:08,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:08,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:02:08,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:08,852 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 10 states. [2018-11-28 23:02:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,032 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-28 23:02:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:09,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-28 23:02:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,036 INFO L225 Difference]: With dead ends: 53 [2018-11-28 23:02:09,036 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 23:02:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 23:02:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-28 23:02:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:02:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-28 23:02:09,041 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2018-11-28 23:02:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,041 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-28 23:02:09,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-28 23:02:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 23:02:09,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,043 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,043 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:09,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114437, now seen corresponding path program 2 times [2018-11-28 23:02:09,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:09,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:09,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:09,871 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:09,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:09,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:09,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 23:02:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-28 23:02:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-11-28 23:02:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:09,966 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 12 states. [2018-11-28 23:02:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,036 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-28 23:02:10,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:10,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-28 23:02:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,039 INFO L225 Difference]: With dead ends: 55 [2018-11-28 23:02:10,039 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 23:02:10,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 23:02:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-28 23:02:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:02:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-28 23:02:10,046 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2018-11-28 23:02:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,046 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-28 23:02:10,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-28 23:02:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 23:02:10,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,048 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] [2018-11-28 23:02:10,048 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1195635521, now seen corresponding path program 1 times [2018-11-28 23:02:10,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:10,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:10,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:10,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:10,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:02:10,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:10,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:10,302 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2018-11-28 23:02:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,404 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-28 23:02:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:10,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-28 23:02:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,407 INFO L225 Difference]: With dead ends: 58 [2018-11-28 23:02:10,407 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 23:02:10,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 23:02:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-28 23:02:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:02:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-28 23:02:10,414 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 48 [2018-11-28 23:02:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,414 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-28 23:02:10,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-28 23:02:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 23:02:10,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,416 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] [2018-11-28 23:02:10,416 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 71279954, now seen corresponding path program 2 times [2018-11-28 23:02:10,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:11,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:11,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:11,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:11,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:11,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 23:02:11,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:11,577 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2018-11-28 23:02:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:11,701 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-28 23:02:11,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:11,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-28 23:02:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:11,706 INFO L225 Difference]: With dead ends: 59 [2018-11-28 23:02:11,706 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 23:02:11,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 23:02:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-28 23:02:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 23:02:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-28 23:02:11,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2018-11-28 23:02:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:11,713 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-28 23:02:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-28 23:02:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 23:02:11,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:11,721 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] [2018-11-28 23:02:11,721 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:11,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash 844524961, now seen corresponding path program 3 times [2018-11-28 23:02:11,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:11,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:11,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:11,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:11,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:11,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:11,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 23:02:11,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:11,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:11,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:11,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:02:11,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:02:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:02:11,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:11,910 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2018-11-28 23:02:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:11,948 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-28 23:02:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:11,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 23:02:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:11,951 INFO L225 Difference]: With dead ends: 68 [2018-11-28 23:02:11,951 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:02:11,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:02:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:02:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-11-28 23:02:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 23:02:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-28 23:02:11,956 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 54 [2018-11-28 23:02:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-28 23:02:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:02:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-28 23:02:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 23:02:11,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:11,957 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] [2018-11-28 23:02:11,959 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:11,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 4 times [2018-11-28 23:02:11,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:11,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:11,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:11,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:12,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:12,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:12,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:02:12,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:02:12,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:12,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:12,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:12,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:02:12,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:12,216 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2018-11-28 23:02:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:12,253 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-28 23:02:12,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:12,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 23:02:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:12,256 INFO L225 Difference]: With dead ends: 73 [2018-11-28 23:02:12,256 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 23:02:12,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 23:02:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-28 23:02:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 23:02:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-28 23:02:12,262 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2018-11-28 23:02:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:12,262 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-28 23:02:12,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-28 23:02:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 23:02:12,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:12,263 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] [2018-11-28 23:02:12,264 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:12,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 5 times [2018-11-28 23:02:12,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:12,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:12,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:12,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:02:12,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-28 23:02:12,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:12,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:12,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:12,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:02:12,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:02:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:02:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:12,637 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2018-11-28 23:02:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:12,678 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-28 23:02:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:12,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-28 23:02:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:12,680 INFO L225 Difference]: With dead ends: 78 [2018-11-28 23:02:12,680 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 23:02:12,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:02:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 23:02:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-11-28 23:02:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 23:02:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-28 23:02:12,684 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2018-11-28 23:02:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:12,685 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-28 23:02:12,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:02:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-28 23:02:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 23:02:12,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:12,686 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] [2018-11-28 23:02:12,686 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 6 times [2018-11-28 23:02:12,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:12,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:12,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:12,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:02:12,986 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-28 23:02:12,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:12,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-28 23:02:13,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:13,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-11-28 23:02:13,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 23:02:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 23:02:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:02:13,150 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 17 states. [2018-11-28 23:02:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:13,390 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-11-28 23:02:13,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:13,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-11-28 23:02:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:13,393 INFO L225 Difference]: With dead ends: 83 [2018-11-28 23:02:13,393 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 23:02:13,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:02:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 23:02:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-28 23:02:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 23:02:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-28 23:02:13,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-11-28 23:02:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:13,397 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-28 23:02:13,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 23:02:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-28 23:02:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 23:02:13,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:13,399 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] [2018-11-28 23:02:13,399 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:13,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 7 times [2018-11-28 23:02:13,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:13,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:13,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:13,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:13,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:13,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:02:13,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:02:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:02:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:13,665 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2018-11-28 23:02:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:13,754 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-28 23:02:13,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:13,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-11-28 23:02:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:13,756 INFO L225 Difference]: With dead ends: 88 [2018-11-28 23:02:13,757 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 23:02:13,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:02:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 23:02:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-11-28 23:02:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 23:02:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-28 23:02:13,761 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2018-11-28 23:02:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-28 23:02:13,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:02:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-28 23:02:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 23:02:13,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:13,762 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] [2018-11-28 23:02:13,763 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:13,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 8 times [2018-11-28 23:02:13,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:13,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:13,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:13,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:13,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:13,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:13,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:14,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:14,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:02:14,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:14,028 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2018-11-28 23:02:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:14,084 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-28 23:02:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:14,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-28 23:02:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:14,088 INFO L225 Difference]: With dead ends: 93 [2018-11-28 23:02:14,088 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 23:02:14,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 23:02:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-11-28 23:02:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 23:02:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-28 23:02:14,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2018-11-28 23:02:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:14,094 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-28 23:02:14,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-28 23:02:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 23:02:14,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:14,098 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] [2018-11-28 23:02:14,098 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:14,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 9 times [2018-11-28 23:02:14,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:14,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:14,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:14,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:14,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:14,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-28 23:02:14,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:14,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:14,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:14,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:02:14,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:02:14,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:02:14,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:14,935 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2018-11-28 23:02:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:14,999 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-28 23:02:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:15,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-11-28 23:02:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:15,002 INFO L225 Difference]: With dead ends: 98 [2018-11-28 23:02:15,002 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 23:02:15,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:02:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 23:02:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-11-28 23:02:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 23:02:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-28 23:02:15,006 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-11-28 23:02:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:15,007 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-28 23:02:15,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:02:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-28 23:02:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 23:02:15,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:15,008 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] [2018-11-28 23:02:15,008 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:15,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 10 times [2018-11-28 23:02:15,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:15,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:15,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:15,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:15,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:15,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:02:15,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:02:15,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:15,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:15,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:15,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:02:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:15,494 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-11-28 23:02:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:15,561 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-11-28 23:02:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:15,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-11-28 23:02:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:15,564 INFO L225 Difference]: With dead ends: 103 [2018-11-28 23:02:15,565 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 23:02:15,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 23:02:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-28 23:02:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 23:02:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-28 23:02:15,568 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2018-11-28 23:02:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:15,569 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-28 23:02:15,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-28 23:02:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 23:02:15,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:15,570 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] [2018-11-28 23:02:15,570 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:15,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 11 times [2018-11-28 23:02:15,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:15,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:15,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:02:18,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-28 23:02:18,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:18,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-28 23:02:18,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:18,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 23:02:18,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:18,416 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2018-11-28 23:02:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:18,479 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-11-28 23:02:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:02:18,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-28 23:02:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:18,483 INFO L225 Difference]: With dead ends: 104 [2018-11-28 23:02:18,483 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 23:02:18,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 23:02:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-28 23:02:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 23:02:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-28 23:02:18,487 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2018-11-28 23:02:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:18,487 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-28 23:02:18,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-28 23:02:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 23:02:18,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:18,489 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] [2018-11-28 23:02:18,489 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-28 23:02:18,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 12 times [2018-11-28 23:02:18,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:18,669 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 23:02:18,725 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-28 23:02:18,726 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-28 23:02:18,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:18 BoogieIcfgContainer [2018-11-28 23:02:18,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:18,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:18,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:18,779 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:18,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:01" (3/4) ... [2018-11-28 23:02:18,783 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 23:02:18,798 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-28 23:02:18,798 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-28 23:02:18,922 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:18,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:18,926 INFO L168 Benchmark]: Toolchain (without parser) took 18686.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 946.0 MB in the beginning and 844.8 MB in the end (delta: 101.2 MB). Peak memory consumption was 378.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:18,927 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:18,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:18,935 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:18,935 INFO L168 Benchmark]: RCFGBuilder took 581.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:18,936 INFO L168 Benchmark]: TraceAbstraction took 17645.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 262.0 MB). Peak memory consumption was 393.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:18,936 INFO L168 Benchmark]: Witness Printer took 145.63 ms. Allocated memory is still 1.3 GB. Free memory was 853.3 MB in the beginning and 844.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:18,945 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.46 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 581.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17645.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 262.0 MB). Peak memory consumption was 393.1 MB. Max. memory is 11.5 GB. * Witness Printer took 145.63 ms. Allocated memory is still 1.3 GB. Free memory was 853.3 MB in the beginning and 844.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. UNSAFE Result, 17.5s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 580 SDtfs, 537 SDslu, 1877 SDs, 0 SdLazy, 1056 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1116 GetRequests, 939 SyntacticMatches, 9 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=22, 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, 22 MinimizatonAttempts, 50 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2071 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1932 ConstructedInterpolants, 4 QuantifiedInterpolants, 273191 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3190 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 2789/4774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...