java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:17:52,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:17:52,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:17:52,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:17:52,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:17:52,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:17:52,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:17:52,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:17:52,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:17:52,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:17:52,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:17:52,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:17:52,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:17:52,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:17:52,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:17:52,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:17:52,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:17:52,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:17:52,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:17:52,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:17:52,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:17:52,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:17:52,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:17:52,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:17:52,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:17:52,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:17:52,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:17:52,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:17:52,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:17:52,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:17:52,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:17:52,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:17:52,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:17:52,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:17:52,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:17:52,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:17:52,322 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:17:52,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:17:52,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:17:52,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:17:52,339 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:17:52,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:17:52,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:17:52,340 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:17:52,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:17:52,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:17:52,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:17:52,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:17:52,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:17:52,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:17:52,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:17:52,342 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:17:52,342 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:17:52,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:17:52,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:17:52,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:17:52,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:17:52,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:17:52,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:17:52,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:17:52,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:17:52,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:17:52,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:17:52,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:17:52,347 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:17:52,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:17:52,347 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:17:52,347 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:17:52,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:17:52,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:17:52,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:17:52,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:17:52,424 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:17:52,424 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:17:52,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-19 16:17:52,772 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53012b49/13dc5eaf0c5a4db0b2c3fb5cf94d446e/FLAGf7559e8af [2018-09-19 16:17:52,935 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:17:52,935 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-09-19 16:17:52,943 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53012b49/13dc5eaf0c5a4db0b2c3fb5cf94d446e/FLAGf7559e8af [2018-09-19 16:17:52,960 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53012b49/13dc5eaf0c5a4db0b2c3fb5cf94d446e [2018-09-19 16:17:52,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:17:52,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:17:52,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:17:52,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:17:52,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:17:52,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:17:52" (1/1) ... [2018-09-19 16:17:52,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3c27be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:52, skipping insertion in model container [2018-09-19 16:17:52,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:17:52" (1/1) ... [2018-09-19 16:17:53,002 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:17:53,278 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:17:53,299 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:17:53,326 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:17:53,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53 WrapperNode [2018-09-19 16:17:53,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:17:53,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:17:53,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:17:53,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:17:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (1/1) ... [2018-09-19 16:17:53,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:17:53,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:17:53,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:17:53,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:17:53,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (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-09-19 16:17:53,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:17:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:17:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-09-19 16:17:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-19 16:17:53,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:17:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:17:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-09-19 16:17:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:17:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:17:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:17:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:17:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:17:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:17:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-19 16:17:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:17:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:17:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:17:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:17:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:17:53,786 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:53,847 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:54,485 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:54,500 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:54,515 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:55,738 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:17:55,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:55 BoogieIcfgContainer [2018-09-19 16:17:55,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:17:55,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:17:55,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:17:55,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:17:55,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:17:52" (1/3) ... [2018-09-19 16:17:55,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41262861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:55, skipping insertion in model container [2018-09-19 16:17:55,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:17:53" (2/3) ... [2018-09-19 16:17:55,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41262861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:55, skipping insertion in model container [2018-09-19 16:17:55,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:55" (3/3) ... [2018-09-19 16:17:55,748 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c_true-unreach-call.c [2018-09-19 16:17:55,758 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:17:55,768 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:17:55,815 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:17:55,815 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:17:55,816 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:17:55,816 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:17:55,816 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:17:55,816 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:17:55,816 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:17:55,817 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:17:55,817 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:17:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-09-19 16:17:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-19 16:17:55,843 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:55,845 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:55,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1646053515, now seen corresponding path program 1 times [2018-09-19 16:17:55,858 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:17:55,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:55,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:17:55,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:56,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:56,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:17:56,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:17:56,031 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:17:56,032 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:17:56,034 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-09-19 16:17:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:56,064 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2018-09-19 16:17:56,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:17:56,066 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-19 16:17:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:56,076 INFO L225 Difference]: With dead ends: 154 [2018-09-19 16:17:56,077 INFO L226 Difference]: Without dead ends: 77 [2018-09-19 16:17:56,081 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:17:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-19 16:17:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-19 16:17:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-19 16:17:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-09-19 16:17:56,129 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 19 [2018-09-19 16:17:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:56,129 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-09-19 16:17:56,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:17:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-09-19 16:17:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 16:17:56,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:56,132 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:56,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:56,133 INFO L82 PathProgramCache]: Analyzing trace with hash -414785187, now seen corresponding path program 1 times [2018-09-19 16:17:56,133 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:56,133 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:17:56,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:17:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:56,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:56,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:17:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:17:56,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:56,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:56,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:17:56,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:56,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:17:56,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:17:56,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:56,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:56,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:17:56,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:17:57,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:57,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:57,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:17:57,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:17:57,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:17:57,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:17:57,198 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 9 states. [2018-09-19 16:17:58,116 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:17:58,630 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:17:58,966 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:18:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:04,863 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-09-19 16:18:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:18:04,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-19 16:18:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:04,868 INFO L225 Difference]: With dead ends: 150 [2018-09-19 16:18:04,868 INFO L226 Difference]: Without dead ends: 86 [2018-09-19 16:18:04,871 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:18:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-19 16:18:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-09-19 16:18:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-19 16:18:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-09-19 16:18:04,881 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 32 [2018-09-19 16:18:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-09-19 16:18:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:18:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-09-19 16:18:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 16:18:04,883 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:04,883 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:04,883 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1355929740, now seen corresponding path program 1 times [2018-09-19 16:18:04,884 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:04,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:04,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:05,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:05,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:05,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:05,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:05,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:05,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:05,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:05,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:05,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:05,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:05,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:05,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:05,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:05,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:05,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:18:05,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:18:05,451 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:18:05,452 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:18:05,452 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 9 states. [2018-09-19 16:18:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:10,687 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-09-19 16:18:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:18:10,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-19 16:18:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:10,691 INFO L225 Difference]: With dead ends: 137 [2018-09-19 16:18:10,691 INFO L226 Difference]: Without dead ends: 79 [2018-09-19 16:18:10,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:18:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-19 16:18:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-09-19 16:18:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:18:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-09-19 16:18:10,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 32 [2018-09-19 16:18:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:10,701 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-09-19 16:18:10,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:18:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-09-19 16:18:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-19 16:18:10,703 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:10,703 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:10,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1719063233, now seen corresponding path program 1 times [2018-09-19 16:18:10,704 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:10,705 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:10,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:10,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:14,148 WARN L178 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:18:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:14,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:14,187 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:14,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 16:18:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:18:14,188 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:18:14,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:18:14,189 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-09-19 16:18:19,635 WARN L178 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:18:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:20,968 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-09-19 16:18:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:18:20,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-09-19 16:18:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:20,982 INFO L225 Difference]: With dead ends: 100 [2018-09-19 16:18:20,983 INFO L226 Difference]: Without dead ends: 64 [2018-09-19 16:18:20,984 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:18:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-19 16:18:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-19 16:18:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:18:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-09-19 16:18:20,992 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 45 [2018-09-19 16:18:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:20,992 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-09-19 16:18:20,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:18:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-09-19 16:18:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:18:20,993 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:20,994 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:20,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1060697608, now seen corresponding path program 1 times [2018-09-19 16:18:20,995 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:20,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:21,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:21,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:21,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:21,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:21,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:21,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:21,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:21,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:21,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:21,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:21,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:21,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:21,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:21,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:21,801 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:21,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:18:21,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:18:21,802 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:18:21,802 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:18:21,802 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 8 states. [2018-09-19 16:18:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:23,732 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-19 16:18:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:18:23,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-09-19 16:18:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:23,735 INFO L225 Difference]: With dead ends: 115 [2018-09-19 16:18:23,735 INFO L226 Difference]: Without dead ends: 79 [2018-09-19 16:18:23,736 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:18:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-19 16:18:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-09-19 16:18:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:18:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-09-19 16:18:23,744 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 46 [2018-09-19 16:18:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:23,745 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-09-19 16:18:23,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:18:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-09-19 16:18:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-19 16:18:23,746 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:23,747 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:23,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:23,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1042625013, now seen corresponding path program 1 times [2018-09-19 16:18:23,748 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:23,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:23,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:23,970 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:23,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:23,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:18:23,997 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:24,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 25 [2018-09-19 16:18:24,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:24,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:18:24,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:24,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:18:24,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-19 16:18:24,328 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:24,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 56 treesize of output 52 [2018-09-19 16:18:24,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:24,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:18:24,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:18:24,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:24,560 INFO L477 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 27 treesize of output 15 [2018-09-19 16:18:24,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:24,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:24,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:18:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:24,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:24,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:24,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:18:24,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:18:24,991 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:18:24,991 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:18:24,991 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 10 states. [2018-09-19 16:18:25,439 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:18:25,741 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:18:26,097 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:18:26,476 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:18:27,390 WARN L178 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:18:27,587 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:18:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:28,630 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-09-19 16:18:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:18:28,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-09-19 16:18:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:28,633 INFO L225 Difference]: With dead ends: 100 [2018-09-19 16:18:28,633 INFO L226 Difference]: Without dead ends: 64 [2018-09-19 16:18:28,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:18:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-19 16:18:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-19 16:18:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:18:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-19 16:18:28,642 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 47 [2018-09-19 16:18:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:28,642 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-19 16:18:28,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:18:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-19 16:18:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-19 16:18:28,643 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:28,644 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:28,644 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1860273463, now seen corresponding path program 1 times [2018-09-19 16:18:28,645 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:28,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:28,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:28,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:28,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:28,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:28,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:28,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:28,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:28,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:28,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:28,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:28,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:29,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:29,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:29,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:29,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:29,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:29,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-19 16:18:29,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-19 16:18:29,341 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:29,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-09-19 16:18:29,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:29,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:29,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-09-19 16:18:29,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-09-19 16:18:29,512 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:29,516 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2018-09-19 16:18:29,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:29,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:36 [2018-09-19 16:18:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:30,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:30,370 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:30,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 16:18:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:18:30,372 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:18:30,372 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:18:30,372 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-09-19 16:18:31,333 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:18:33,677 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-09-19 16:18:33,944 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-09-19 16:18:34,273 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-09-19 16:18:34,675 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-09-19 16:18:35,060 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-09-19 16:18:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:18:36,134 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-09-19 16:18:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 16:18:36,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-09-19 16:18:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:18:36,137 INFO L225 Difference]: With dead ends: 67 [2018-09-19 16:18:36,137 INFO L226 Difference]: Without dead ends: 64 [2018-09-19 16:18:36,138 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2018-09-19 16:18:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-19 16:18:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-19 16:18:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:18:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2018-09-19 16:18:36,146 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 47 [2018-09-19 16:18:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:18:36,147 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2018-09-19 16:18:36,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:18:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2018-09-19 16:18:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 16:18:36,148 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:18:36,148 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:18:36,149 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:18:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -723670816, now seen corresponding path program 1 times [2018-09-19 16:18:36,149 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:18:36,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:18:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:18:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:18:36,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:18:36,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:36,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:36,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:36,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:36,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:36,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:36,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:36,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:36,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:36,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-19 16:18:36,775 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:36,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-09-19 16:18:36,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:36,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-09-19 16:18:36,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-09-19 16:18:36,838 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:18:36,844 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2018-09-19 16:18:36,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:36,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:28 [2018-09-19 16:18:39,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:18:39,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:18:39,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:39,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:39,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:39,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:18:39,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:18:39,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:18:39,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:18:39,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:18:39,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:18:39,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:18:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:18:40,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:18:40,582 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:18:40,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-19 16:18:40,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-19 16:18:40,584 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-19 16:18:40,584 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=342, Unknown=1, NotChecked=0, Total=380 [2018-09-19 16:18:40,584 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand 20 states. [2018-09-19 16:18:49,100 WARN L178 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-19 16:18:51,431 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:18:53,753 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:18:56,109 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:18:58,642 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:19:02,731 WARN L178 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:05,187 WARN L178 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:07,934 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:19:08,278 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:09,443 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-09-19 16:19:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 16:19:09,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-09-19 16:19:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:09,445 INFO L225 Difference]: With dead ends: 64 [2018-09-19 16:19:09,445 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:19:09,447 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=179, Invalid=1460, Unknown=1, NotChecked=0, Total=1640 [2018-09-19 16:19:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:19:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:19:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:19:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:19:09,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-09-19 16:19:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:09,448 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:19:09,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-19 16:19:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:19:09,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:19:09,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:19:09,663 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-19 16:19:09,810 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-19 16:19:09,927 INFO L426 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-09-19 16:19:09,928 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-09-19 16:19:09,928 INFO L422 ceAbstractionStarter]: At program point L19-3(lines 19 24) the Hoare annotation is: (or (= floor_double_~x |floor_double_#in~x|) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-19 16:19:09,928 INFO L426 ceAbstractionStarter]: For program point L19-4(lines 19 24) no Hoare annotation was computed. [2018-09-19 16:19:09,928 INFO L426 ceAbstractionStarter]: For program point floor_doubleFINAL(lines 16 77) no Hoare annotation was computed. [2018-09-19 16:19:09,928 INFO L426 ceAbstractionStarter]: For program point L28(lines 28 35) no Hoare annotation was computed. [2018-09-19 16:19:09,928 INFO L426 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L429 ceAbstractionStarter]: At program point floor_doubleENTRY(lines 16 77) the Hoare annotation is: true [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L70(lines 70 75) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L70-2(lines 16 77) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L70-3(lines 70 75) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 63) no Hoare annotation was computed. [2018-09-19 16:19:09,929 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L62-2(lines 62 63) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L71-2(line 71) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L71-3(line 71) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-19 16:19:09,930 INFO L426 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 69) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 34) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L56(lines 56 68) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L48(lines 48 51) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-19 16:19:09,931 INFO L426 ceAbstractionStarter]: For program point L40(lines 40 45) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L57(lines 57 66) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 57 66) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point floor_doubleEXIT(lines 16 77) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-19 16:19:09,932 INFO L426 ceAbstractionStarter]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point L74-3(line 74) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 65) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 69) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:19:09,933 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 79 89) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 79 89) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L85-1(line 85) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L85-2(line 85) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L83-1(line 83) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L83-2(line 83) no Hoare annotation was computed. [2018-09-19 16:19:09,934 INFO L426 ceAbstractionStarter]: For program point L82-1(lines 82 86) no Hoare annotation was computed. [2018-09-19 16:19:09,935 INFO L426 ceAbstractionStarter]: For program point L83-3(line 83) no Hoare annotation was computed. [2018-09-19 16:19:09,935 INFO L422 ceAbstractionStarter]: At program point L82-3(lines 82 86) the Hoare annotation is: (or (= |__signbit_double_#in~x| __signbit_double_~x) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-19 16:19:09,935 INFO L426 ceAbstractionStarter]: For program point L82-4(lines 82 86) no Hoare annotation was computed. [2018-09-19 16:19:09,935 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 79 89) the Hoare annotation is: true [2018-09-19 16:19:09,935 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:19:09,935 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) [2018-09-19 16:19:09,935 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:19:09,935 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:19:09,935 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 91 108) the Hoare annotation is: true [2018-09-19 16:19:09,935 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 91 108) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 91 108) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L426 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L422 ceAbstractionStarter]: At program point L102-1(line 102) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0)) (and (exists ((v_arrayElimCell_21 (_ BitVec 32)) (|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|)) (fp.neg (_ +zero 11 53))) (= (let ((.cse0 (concat ((_ extract 63 32) |v_q#valueAsBitvector_12|) v_arrayElimCell_21))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) |main_#t~short10| (= main_~x~0 (fp.neg (_ +zero 11 53))))) [2018-09-19 16:19:09,936 INFO L426 ceAbstractionStarter]: For program point L102-2(line 102) no Hoare annotation was computed. [2018-09-19 16:19:09,936 INFO L422 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (or (= main_~x~0 (fp.neg (_ +zero 11 53))) (not (= ((_ to_fp 11 53) RNE 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-09-19 16:19:09,937 INFO L426 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-09-19 16:19:09,937 INFO L426 ceAbstractionStarter]: For program point L102-4(lines 102 105) no Hoare annotation was computed. [2018-09-19 16:19:09,943 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,947 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,949 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,949 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:19:09 BoogieIcfgContainer [2018-09-19 16:19:09,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:19:09,953 INFO L168 Benchmark]: Toolchain (without parser) took 76980.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 855.6 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -627.9 MB). Peak memory consumption was 227.7 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:09,954 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:09,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:09,955 INFO L168 Benchmark]: Boogie Preprocessor took 85.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:09,956 INFO L168 Benchmark]: RCFGBuilder took 2286.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -714.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:09,956 INFO L168 Benchmark]: TraceAbstraction took 74212.04 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 161.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 73.7 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:09,959 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2286.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -714.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74212.04 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 161.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 73.7 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant [2018-09-19 16:19:09,965 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,966 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE Derived loop invariant: \old(x) == x || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) - InvariantResult [Line: 19]: Loop Invariant [2018-09-19 16:19:09,966 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE [2018-09-19 16:19:09,966 WARN L389 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression RoundingMode_RNE Derived loop invariant: x == \old(x) || !(~to_fp~LONGDOUBLE(RoundingMode_RNE, 1.0E300) == huge_floor) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 81 locations, 1 error locations. SAFE Result, 74.1s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 59.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 491 SDtfs, 688 SDslu, 2425 SDs, 0 SdLazy, 1384 SolverSat, 94 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, 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, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 25 NumberOfFragments, 84 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 323 ConstructedInterpolants, 175 QuantifiedInterpolants, 192825 SizeOfPredicates, 67 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...