./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60fa12f4a8e344f82de5faf31b8f2cbfbaaacd93 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:49:44,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:44,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:44,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:44,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:44,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:44,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:44,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:44,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:44,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:44,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:44,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:44,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:44,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:44,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:44,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:44,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:44,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:44,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:44,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:44,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:44,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:44,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:44,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:44,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:44,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:44,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:44,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:44,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:44,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:44,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:44,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:44,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:44,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:44,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:44,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:44,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:44,227 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:44,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:44,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:44,231 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:44,231 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:44,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:44,231 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:44,232 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:44,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:44,233 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:44,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:44,233 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:44,233 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:44,234 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:44,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:44,235 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:44,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:44,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:44,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:44,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:44,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:44,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:44,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:44,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:44,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:44,238 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 -> 60fa12f4a8e344f82de5faf31b8f2cbfbaaacd93 [2019-01-14 20:49:44,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:44,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:44,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:44,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:44,313 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:44,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c [2019-01-14 20:49:44,386 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d06d3f6/eb62a889f3b94090ba9f3dc9980ffb26/FLAGa212ec842 [2019-01-14 20:49:44,843 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:44,843 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c [2019-01-14 20:49:44,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d06d3f6/eb62a889f3b94090ba9f3dc9980ffb26/FLAGa212ec842 [2019-01-14 20:49:45,224 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d06d3f6/eb62a889f3b94090ba9f3dc9980ffb26 [2019-01-14 20:49:45,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:45,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:45,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:45,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:45,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:45,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694eaae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45, skipping insertion in model container [2019-01-14 20:49:45,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:45,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:45,444 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:45,469 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:45,488 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:45,507 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:45,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45 WrapperNode [2019-01-14 20:49:45,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:45,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:45,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:45,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:45,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... [2019-01-14 20:49:45,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:45,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:45,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:45,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:45,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 20:49:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 20:49:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:46,050 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:46,051 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 20:49:46,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:46 BoogieIcfgContainer [2019-01-14 20:49:46,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:46,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:46,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:46,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:46,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:45" (1/3) ... [2019-01-14 20:49:46,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1a270e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:46, skipping insertion in model container [2019-01-14 20:49:46,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:45" (2/3) ... [2019-01-14 20:49:46,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1a270e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:46, skipping insertion in model container [2019-01-14 20:49:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:46" (3/3) ... [2019-01-14 20:49:46,062 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1_true-valid-memsafety.c [2019-01-14 20:49:46,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:46,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-14 20:49:46,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-14 20:49:46,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:46,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:46,130 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:46,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:46,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:46,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:46,130 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:46,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:46,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-14 20:49:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 20:49:46,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:46,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:46,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2019-01-14 20:49:46,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:46,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:46,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:46,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:46,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:46,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:46,374 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-01-14 20:49:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:46,462 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 20:49:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:46,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 20:49:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:46,475 INFO L225 Difference]: With dead ends: 26 [2019-01-14 20:49:46,475 INFO L226 Difference]: Without dead ends: 21 [2019-01-14 20:49:46,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-14 20:49:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 20:49:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 20:49:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-14 20:49:46,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2019-01-14 20:49:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:46,516 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-14 20:49:46,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-14 20:49:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 20:49:46,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:46,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:46,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:46,518 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2019-01-14 20:49:46,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:46,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:46,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:46,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:46,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:46,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 20:49:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 20:49:46,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:46,751 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2019-01-14 20:49:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:46,925 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-14 20:49:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:46,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 20:49:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:46,927 INFO L225 Difference]: With dead ends: 24 [2019-01-14 20:49:46,927 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 20:49:46,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:49:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 20:49:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-14 20:49:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 20:49:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-14 20:49:46,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2019-01-14 20:49:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:46,933 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-14 20:49:46,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 20:49:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-14 20:49:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:46,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:46,935 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:46,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2019-01-14 20:49:46,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:46,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:47,279 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-14 20:49:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:47,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:47,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:47,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:47,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 20:49:47,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:47,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:47,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 20:49:47,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:47,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:47,582 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 11 treesize of output 14 [2019-01-14 20:49:47,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 20:49:47,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:47,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:47,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-01-14 20:49:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:47,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:47,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-14 20:49:47,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:47,976 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-01-14 20:49:48,589 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-01-14 20:49:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:48,674 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-14 20:49:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:48,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-01-14 20:49:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:48,677 INFO L225 Difference]: With dead ends: 27 [2019-01-14 20:49:48,677 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 20:49:48,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 20:49:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-14 20:49:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 20:49:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-14 20:49:48,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 12 [2019-01-14 20:49:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:48,683 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-14 20:49:48,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-14 20:49:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:49:48,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:48,685 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:48,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 1 times [2019-01-14 20:49:48,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 20:49:48,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:48,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:49:48,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:48,799 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2019-01-14 20:49:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:48,917 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 20:49:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:48,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-14 20:49:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:48,920 INFO L225 Difference]: With dead ends: 26 [2019-01-14 20:49:48,920 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 20:49:48,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 20:49:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 20:49:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 20:49:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-14 20:49:48,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-01-14 20:49:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:48,926 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-14 20:49:48,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-14 20:49:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:49:48,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:48,927 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:48,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383287, now seen corresponding path program 1 times [2019-01-14 20:49:48,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:48,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:49,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:49,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:49,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:49,200 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2019-01-14 20:49:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:49,281 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-14 20:49:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:49,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 20:49:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:49,283 INFO L225 Difference]: With dead ends: 31 [2019-01-14 20:49:49,283 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 20:49:49,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 20:49:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 20:49:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 20:49:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-14 20:49:49,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2019-01-14 20:49:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:49,289 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-14 20:49:49,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-14 20:49:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:49:49,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:49,291 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:49,291 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 20:49:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -149204608, now seen corresponding path program 2 times [2019-01-14 20:49:49,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:49:49,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:49,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:49:49,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:49,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:49,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:49,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:49,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 20:49:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:49:49,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 20:49:49,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:49,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:49,530 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 11 treesize of output 14 [2019-01-14 20:49:49,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 20:49:49,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:49:49,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:49:49,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:49:49,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-01-14 20:49:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 20:49:49,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:49,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-01-14 20:49:49,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:49:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:49:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:49,830 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2019-01-14 20:49:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:50,218 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-01-14 20:49:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:50,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-01-14 20:49:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:50,219 INFO L225 Difference]: With dead ends: 34 [2019-01-14 20:49:50,219 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 20:49:50,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-01-14 20:49:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 20:49:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 20:49:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 20:49:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 20:49:50,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-01-14 20:49:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:50,222 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 20:49:50,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:49:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 20:49:50,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 20:49:50,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:49:50 BoogieIcfgContainer [2019-01-14 20:49:50,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:49:50,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:49:50,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:49:50,228 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:49:50,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:46" (3/4) ... [2019-01-14 20:49:50,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 20:49:50,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 20:49:50,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 20:49:50,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-01-14 20:49:50,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-14 20:49:50,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 20:49:50,244 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 20:49:50,244 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 20:49:50,293 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:49:50,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:49:50,294 INFO L168 Benchmark]: Toolchain (without parser) took 5065.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.3 MB in the beginning and 891.7 MB in the end (delta: 59.7 MB). Peak memory consumption was 192.3 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:50,295 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:50,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:50,296 INFO L168 Benchmark]: Boogie Preprocessor took 41.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:50,297 INFO L168 Benchmark]: RCFGBuilder took 502.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:50,297 INFO L168 Benchmark]: TraceAbstraction took 4173.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 216.8 MB). Peak memory consumption was 216.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:50,300 INFO L168 Benchmark]: Witness Printer took 65.63 ms. Allocated memory is still 1.2 GB. Free memory is still 891.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:50,306 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4173.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 216.8 MB). Peak memory consumption was 216.8 MB. Max. memory is 11.5 GB. * Witness Printer took 65.63 ms. Allocated memory is still 1.2 GB. Free memory is still 891.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. SAFE Result, 4.1s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 119 SDslu, 168 SDs, 0 SdLazy, 204 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 163 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 154 ConstructedInterpolants, 34 QuantifiedInterpolants, 19046 SizeOfPredicates, 5 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 34/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...