./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 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/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-91b1670 [2018-11-28 23:02:07,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:02:07,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:02:07,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:02:07,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:02:07,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:02:07,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:02:07,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:02:07,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:07,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:07,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:07,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:07,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:07,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:07,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:07,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:07,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:07,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:07,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:07,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:07,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:07,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:07,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:07,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:07,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:07,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:07,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:07,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:07,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:07,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:07,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:07,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:07,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:07,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:07,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:07,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:07,245 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:02:07,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:07,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:07,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:07,274 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:07,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:07,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:07,279 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:07,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:07,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:07,280 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:07,283 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:02:07,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:07,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:07,283 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:07,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:07,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:07,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:07,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:07,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:07,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:07,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:07,286 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:07,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:07,287 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 [2018-11-28 23:02:07,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:07,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:07,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:07,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:07,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:07,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c [2018-11-28 23:02:07,411 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370daee9a/b375e69e309f4131b8db4146b03e353a/FLAGdfb98112f [2018-11-28 23:02:07,819 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:07,820 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_true-valid-memsafety.c [2018-11-28 23:02:07,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370daee9a/b375e69e309f4131b8db4146b03e353a/FLAGdfb98112f [2018-11-28 23:02:08,205 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370daee9a/b375e69e309f4131b8db4146b03e353a [2018-11-28 23:02:08,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:08,211 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:08,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:08,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:08,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:08,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:08" (1/1) ... [2018-11-28 23:02:08,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef72e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:08, skipping insertion in model container [2018-11-28 23:02:08,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:08" (1/1) ... [2018-11-28 23:02:08,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:08,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:08,415 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:08,431 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:08,448 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:08,468 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:08,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:08 WrapperNode [2018-11-28 23:02:08,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:08,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:08,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:08,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:08,481 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:08" (1/1) ... [2018-11-28 23:02:08,481 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:08" (1/1) ... [2018-11-28 23:02:08,489 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:08" (1/1) ... [2018-11-28 23:02:08,490 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:08" (1/1) ... [2018-11-28 23:02:08,498 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:08" (1/1) ... [2018-11-28 23:02:08,503 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:08" (1/1) ... [2018-11-28 23:02:08,505 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:08" (1/1) ... [2018-11-28 23:02:08,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:08,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:08,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:08,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:08,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:08" (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:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-28 23:02:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-28 23:02:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-28 23:02:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:09,055 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:09,056 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 23:02:09,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:09 BoogieIcfgContainer [2018-11-28 23:02:09,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:09,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:09,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:09,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:09,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:08" (1/3) ... [2018-11-28 23:02:09,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765861d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:09, skipping insertion in model container [2018-11-28 23:02:09,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:08" (2/3) ... [2018-11-28 23:02:09,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765861d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:09, skipping insertion in model container [2018-11-28 23:02:09,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:09" (3/3) ... [2018-11-28 23:02:09,067 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1_true-valid-memsafety.c [2018-11-28 23:02:09,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:09,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-28 23:02:09,105 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-28 23:02:09,133 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:09,134 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:09,134 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:09,134 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:09,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:09,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:09,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:09,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:09,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-28 23:02:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:02:09,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:09,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2018-11-28 23:02:09,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,398 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:09,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:09,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:09,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:09,424 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-28 23:02:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,516 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-28 23:02:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:09,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 23:02:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,530 INFO L225 Difference]: With dead ends: 26 [2018-11-28 23:02:09,530 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 23:02:09,532 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:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 23:02:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 23:02:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:02:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:02:09,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2018-11-28 23:02:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,576 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:02:09,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:02:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 23:02:09,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:09,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2018-11-28 23:02:09,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,869 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:09,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:09,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:09,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:02:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:02:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:02:09,873 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2018-11-28 23:02:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,068 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-28 23:02:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:02:10,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-28 23:02:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,070 INFO L225 Difference]: With dead ends: 24 [2018-11-28 23:02:10,070 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 23:02:10,071 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 [2018-11-28 23:02:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 23:02:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 23:02:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:02:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 23:02:10,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2018-11-28 23:02:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,077 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 23:02:10,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:02:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-28 23:02:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:10,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,078 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:10,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2018-11-28 23:02:10,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,456 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:10,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:10,457 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:10,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:10,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,570 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:10,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:10,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:10,580 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 [2018-11-28 23:02:10,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:10,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:10,620 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 [2018-11-28 23:02:10,660 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 [2018-11-28 23:02:10,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:10,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:10,684 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. [2018-11-28 23:02:10,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-11-28 23:02:11,012 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:02:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:11,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-28 23:02:11,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:11,038 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-28 23:02:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:11,250 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-28 23:02:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:11,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-11-28 23:02:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:11,252 INFO L225 Difference]: With dead ends: 27 [2018-11-28 23:02:11,252 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 23:02:11,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 23:02:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 23:02:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:02:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-28 23:02:11,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2018-11-28 23:02:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:11,258 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-28 23:02:11,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-28 23:02:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 23:02:11,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:11,259 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:11,259 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:11,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1912985381, now seen corresponding path program 2 times [2018-11-28 23:02:11,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:11,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:11,454 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:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:11,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:11,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:11,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:11,537 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:11,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:11,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:11,548 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 [2018-11-28 23:02:11,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:11,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:11,596 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 [2018-11-28 23:02:11,616 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 [2018-11-28 23:02:11,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:11,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:11,631 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. [2018-11-28 23:02:11,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-11-28 23:02:11,871 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:02:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-28 23:02:12,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:12,234 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-28 23:02:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:12,783 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-28 23:02:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:12,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-28 23:02:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:12,786 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:02:12,786 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:02:12,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:02:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:02:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 23:02:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:02:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-28 23:02:12,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 15 [2018-11-28 23:02:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:12,793 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-28 23:02:12,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-28 23:02:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:02:12,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:12,794 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:12,794 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:12,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash -149204609, now seen corresponding path program 1 times [2018-11-28 23:02:12,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 23:02:12,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:02:12,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:02:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:02:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:02:12,912 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-11-28 23:02:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:13,023 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-28 23:02:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:13,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 23:02:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:13,027 INFO L225 Difference]: With dead ends: 29 [2018-11-28 23:02:13,027 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:02:13,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:02:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 23:02:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:02:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-28 23:02:13,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-28 23:02:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:13,037 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-28 23:02:13,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:02:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-28 23:02:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:02:13,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:13,039 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:13,039 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:13,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -149204608, now seen corresponding path program 1 times [2018-11-28 23:02:13,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:13,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,161 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:13,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:13,162 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:13,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:13,256 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:13,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:02:13,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:13,280 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-11-28 23:02:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:13,351 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-28 23:02:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:13,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 23:02:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:13,353 INFO L225 Difference]: With dead ends: 34 [2018-11-28 23:02:13,353 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:02:13,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:02:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 23:02:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:02:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-28 23:02:13,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-28 23:02:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:13,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-28 23:02:13,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-28 23:02:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 23:02:13,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:13,360 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:13,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-28 23:02:13,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash -578344215, now seen corresponding path program 2 times [2018-11-28 23:02:13,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:13,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:13,465 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:13,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:13,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 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:13,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:13,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:02:13,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:13,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:13,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 [2018-11-28 23:02:13,552 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 [2018-11-28 23:02:13,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 23:02:13,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:02:13,577 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 [2018-11-28 23:02:13,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:13,616 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. [2018-11-28 23:02:13,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-11-28 23:02:13,802 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:13,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:02:13,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-11-28 23:02:13,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:02:13,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:02:13,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:02:13,823 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 13 states. [2018-11-28 23:02:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:14,300 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-28 23:02:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:02:14,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-28 23:02:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:14,301 INFO L225 Difference]: With dead ends: 37 [2018-11-28 23:02:14,301 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:02:14,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:02:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:02:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:02:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:02:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:02:14,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-28 23:02:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:14,303 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:02:14,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:02:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:02:14,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:02:14,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:14 BoogieIcfgContainer [2018-11-28 23:02:14,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:14,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:14,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:14,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:14,310 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:09" (3/4) ... [2018-11-28 23:02:14,314 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:02:14,320 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:02:14,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:02:14,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-11-28 23:02:14,325 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 23:02:14,326 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 23:02:14,326 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:02:14,326 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:02:14,368 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:14,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:14,369 INFO L168 Benchmark]: Toolchain (without parser) took 6158.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.3 MB in the beginning and 821.3 MB in the end (delta: 122.0 MB). Peak memory consumption was 255.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:14,370 INFO L168 Benchmark]: CDTParser took 0.18 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:14,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.5 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:14,372 INFO L168 Benchmark]: Boogie Preprocessor took 38.93 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:14,372 INFO L168 Benchmark]: RCFGBuilder took 548.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:14,373 INFO L168 Benchmark]: TraceAbstraction took 5251.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.3 MB in the end (delta: 282.7 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:14,374 INFO L168 Benchmark]: Witness Printer took 59.08 ms. Allocated memory is still 1.2 GB. Free memory is still 821.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:14,378 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.18 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 256.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.93 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 548.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5251.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.3 MB in the end (delta: 282.7 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.08 ms. Allocated memory is still 1.2 GB. Free memory is still 821.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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: 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, 5.1s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 109 SDtfs, 166 SDslu, 242 SDs, 0 SdLazy, 314 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=6, 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, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 208 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 197 ConstructedInterpolants, 50 QuantifiedInterpolants, 28109 SizeOfPredicates, 6 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 64/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...