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_1252a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:19:30,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:19:30,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:19:30,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:19:30,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:19:30,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:19:30,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:19:30,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:19:30,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:19:30,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:19:30,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:19:30,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:19:30,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:19:30,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:19:30,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:19:30,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:19:30,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:19:30,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:19:30,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:19:30,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:19:30,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:19:30,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:19:30,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:19:30,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:19:30,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:19:30,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:19:30,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:19:30,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:19:30,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:19:30,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:19:30,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:19:30,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:19:30,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:19:30,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:19:30,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:19:30,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:19:30,491 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:19:30,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:19:30,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:19:30,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:19:30,518 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:19:30,519 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:19:30,519 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:19:30,519 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:19:30,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:19:30,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:19:30,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:19:30,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:19:30,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:19:30,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:19:30,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:19:30,522 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:19:30,523 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:19:30,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:19:30,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:19:30,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:19:30,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:19:30,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:19:30,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:19:30,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:19:30,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:19:30,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:19:30,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:19:30,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:19:30,525 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:19:30,525 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:19:30,527 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:19:30,527 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:19:30,527 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:19:30,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:19:30,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:19:30,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:19:30,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:19:30,626 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:19:30,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-09-19 16:19:30,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755be2055/2892bfdabbed41739dae37c6f06ce09f/FLAG1a05a34ae [2018-09-19 16:19:31,137 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:19:31,137 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-09-19 16:19:31,144 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755be2055/2892bfdabbed41739dae37c6f06ce09f/FLAG1a05a34ae [2018-09-19 16:19:31,159 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755be2055/2892bfdabbed41739dae37c6f06ce09f [2018-09-19 16:19:31,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:19:31,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:19:31,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:31,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:19:31,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:19:31,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a98ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31, skipping insertion in model container [2018-09-19 16:19:31,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,201 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:19:31,499 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:31,534 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:19:31,568 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:31,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31 WrapperNode [2018-09-19 16:19:31,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:31,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:19:31,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:19:31,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:19:31,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (1/1) ... [2018-09-19 16:19:31,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:19:31,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:19:31,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:19:31,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:19:31,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (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:19:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:19:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:19:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-19 16:19:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-19 16:19:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-19 16:19:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:19:31,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:19:31,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:19:31,837 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-19 16:19:31,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-19 16:19:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:19:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:19:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:19:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:19:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:19:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:19:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:19:32,019 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:32,074 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:32,394 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:32,417 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:32,431 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:32,511 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:19:32,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:32 BoogieIcfgContainer [2018-09-19 16:19:32,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:19:32,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:19:32,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:19:32,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:19:32,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:19:31" (1/3) ... [2018-09-19 16:19:32,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26977a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:32, skipping insertion in model container [2018-09-19 16:19:32,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:31" (2/3) ... [2018-09-19 16:19:32,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26977a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:32, skipping insertion in model container [2018-09-19 16:19:32,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:32" (3/3) ... [2018-09-19 16:19:32,521 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a_true-unreach-call.c [2018-09-19 16:19:32,532 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:19:32,540 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:19:32,590 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:19:32,591 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:19:32,591 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:19:32,591 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:19:32,592 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:19:32,592 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:19:32,592 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:19:32,592 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:19:32,592 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:19:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-09-19 16:19:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 16:19:32,620 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:32,622 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] [2018-09-19 16:19:32,624 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:32,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1225609055, now seen corresponding path program 1 times [2018-09-19 16:19:32,634 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:32,635 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:19:32,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:32,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:32,734 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:19:32,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:32,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:32,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:19:32,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:19:32,769 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:19:32,769 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:19:32,772 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-09-19 16:19:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:32,805 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2018-09-19 16:19:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:19:32,807 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 16:19:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:32,819 INFO L225 Difference]: With dead ends: 115 [2018-09-19 16:19:32,819 INFO L226 Difference]: Without dead ends: 58 [2018-09-19 16:19:32,827 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:19:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-19 16:19:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-19 16:19:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-19 16:19:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-09-19 16:19:32,883 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 21 [2018-09-19 16:19:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:32,883 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-09-19 16:19:32,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:19:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-09-19 16:19:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 16:19:32,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:32,886 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] [2018-09-19 16:19:32,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash 132746963, now seen corresponding path program 1 times [2018-09-19 16:19:32,888 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:32,888 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) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:32,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:33,060 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:19:33,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:33,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:33,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:33,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:33,080 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:33,080 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:33,081 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 4 states. [2018-09-19 16:19:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:33,239 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-09-19 16:19:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:33,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-09-19 16:19:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:33,245 INFO L225 Difference]: With dead ends: 84 [2018-09-19 16:19:33,245 INFO L226 Difference]: Without dead ends: 61 [2018-09-19 16:19:33,249 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-19 16:19:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-19 16:19:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-19 16:19:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-09-19 16:19:33,274 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 34 [2018-09-19 16:19:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:33,275 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-09-19 16:19:33,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-09-19 16:19:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 16:19:33,276 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:33,281 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] [2018-09-19 16:19:33,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash 201431320, now seen corresponding path program 1 times [2018-09-19 16:19:33,282 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:33,282 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:19:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:33,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:33,505 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:19:33,514 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:19:33,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,557 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:19:33,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:33,622 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:19:33,629 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:19:33,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,680 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:19:33,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:34,431 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:19:34,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:34,445 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:34,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:34,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:34,446 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:34,447 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:34,447 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 10 states. [2018-09-19 16:19:35,372 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:36,992 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-09-19 16:19:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:36,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-09-19 16:19:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:36,995 INFO L225 Difference]: With dead ends: 91 [2018-09-19 16:19:36,995 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:19:36,997 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:19:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:19:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:19:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:19:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-09-19 16:19:37,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 35 [2018-09-19 16:19:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:37,007 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-09-19 16:19:37,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-09-19 16:19:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-19 16:19:37,009 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:37,009 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] [2018-09-19 16:19:37,009 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1544592367, now seen corresponding path program 1 times [2018-09-19 16:19:37,010 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:37,011 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:19:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:37,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:37,130 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:19:37,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:37,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:37,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:37,144 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:37,145 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:37,145 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-09-19 16:19:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:37,210 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-09-19 16:19:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:37,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-09-19 16:19:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:37,213 INFO L225 Difference]: With dead ends: 89 [2018-09-19 16:19:37,213 INFO L226 Difference]: Without dead ends: 66 [2018-09-19 16:19:37,214 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-19 16:19:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-09-19 16:19:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:19:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-09-19 16:19:37,223 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 36 [2018-09-19 16:19:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:37,223 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-09-19 16:19:37,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-09-19 16:19:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-19 16:19:37,225 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:37,225 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] [2018-09-19 16:19:37,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -553142156, now seen corresponding path program 1 times [2018-09-19 16:19:37,226 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:37,227 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:19:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:37,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:37,351 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:19:37,357 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:19:37,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,382 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:19:37,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:37,438 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:19:37,443 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:19:37,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,457 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:19:37,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:37,737 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:19:37,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:37,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:37,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:37,754 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:37,754 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:37,754 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 10 states. [2018-09-19 16:19:38,275 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:19:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:39,993 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-09-19 16:19:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:39,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-09-19 16:19:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:39,996 INFO L225 Difference]: With dead ends: 90 [2018-09-19 16:19:39,996 INFO L226 Difference]: Without dead ends: 62 [2018-09-19 16:19:39,998 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:19:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-19 16:19:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-09-19 16:19:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-19 16:19:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-09-19 16:19:40,005 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 37 [2018-09-19 16:19:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:40,006 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-09-19 16:19:40,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-09-19 16:19:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-19 16:19:40,008 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:40,008 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:40,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1819330129, now seen corresponding path program 1 times [2018-09-19 16:19:40,009 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:40,009 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:19:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:40,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:40,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:40,159 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:40,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:40,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:40,160 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:40,160 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:40,160 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2018-09-19 16:19:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:40,243 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-09-19 16:19:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:40,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-09-19 16:19:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:40,246 INFO L225 Difference]: With dead ends: 86 [2018-09-19 16:19:40,246 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:19:40,247 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:19:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:19:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:19:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-09-19 16:19:40,256 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 54 [2018-09-19 16:19:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:40,257 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-09-19 16:19:40,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-09-19 16:19:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-19 16:19:40,260 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:40,261 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:40,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1654387358, now seen corresponding path program 1 times [2018-09-19 16:19:40,262 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:40,262 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) [2018-09-19 16:19:40,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:40,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:40,453 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:19:40,463 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:19:40,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:40,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:40,483 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:19:40,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:40,549 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:19:40,564 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:19:40,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:40,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:40,576 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:19:40,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:40,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:40,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:40,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:40,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:40,951 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:40,951 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:40,951 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 10 states. [2018-09-19 16:19:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:43,207 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-09-19 16:19:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:43,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-09-19 16:19:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:43,211 INFO L225 Difference]: With dead ends: 91 [2018-09-19 16:19:43,211 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:19:43,213 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:19:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:19:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:19:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:19:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-09-19 16:19:43,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 55 [2018-09-19 16:19:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:43,221 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-09-19 16:19:43,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-09-19 16:19:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-19 16:19:43,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:43,222 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:43,223 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash -953708108, now seen corresponding path program 1 times [2018-09-19 16:19:43,223 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:43,224 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:19:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:43,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:43,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:43,480 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:43,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:19:43,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:19:43,481 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:19:43,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:19:43,482 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-09-19 16:19:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:43,690 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-09-19 16:19:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:19:43,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-09-19 16:19:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:43,692 INFO L225 Difference]: With dead ends: 87 [2018-09-19 16:19:43,692 INFO L226 Difference]: Without dead ends: 63 [2018-09-19 16:19:43,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:19:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-19 16:19:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-19 16:19:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:19:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-09-19 16:19:43,701 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 56 [2018-09-19 16:19:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-09-19 16:19:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:19:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-09-19 16:19:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-19 16:19:43,702 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:43,703 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:43,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1763054734, now seen corresponding path program 1 times [2018-09-19 16:19:43,704 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:43,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:43,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:43,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:43,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:43,954 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:43,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:19:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:19:43,955 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:19:43,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:19:43,956 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 8 states. [2018-09-19 16:19:44,247 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:19:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:44,472 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-09-19 16:19:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:19:44,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-09-19 16:19:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:44,474 INFO L225 Difference]: With dead ends: 70 [2018-09-19 16:19:44,475 INFO L226 Difference]: Without dead ends: 67 [2018-09-19 16:19:44,476 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-19 16:19:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-19 16:19:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:19:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-09-19 16:19:44,483 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 56 [2018-09-19 16:19:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:44,484 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-09-19 16:19:44,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:19:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-09-19 16:19:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-19 16:19:44,485 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:44,485 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:44,485 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1622182773, now seen corresponding path program 1 times [2018-09-19 16:19:44,486 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:44,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:44,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:44,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:44,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:44,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:44,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:44,659 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:44,659 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:44,660 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 4 states. [2018-09-19 16:19:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:44,681 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-09-19 16:19:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:44,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-09-19 16:19:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:44,682 INFO L225 Difference]: With dead ends: 91 [2018-09-19 16:19:44,683 INFO L226 Difference]: Without dead ends: 68 [2018-09-19 16:19:44,683 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-19 16:19:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-09-19 16:19:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-19 16:19:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-09-19 16:19:44,691 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 56 [2018-09-19 16:19:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:44,691 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-09-19 16:19:44,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-09-19 16:19:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-19 16:19:44,693 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:44,693 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:44,693 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1409894658, now seen corresponding path program 1 times [2018-09-19 16:19:44,694 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:44,694 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:44,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:44,859 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:19:44,865 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:19:44,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:44,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:44,929 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:19:44,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:44,968 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:19:44,974 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:19:44,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:44,989 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:19:44,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:45,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:45,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:45,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:45,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:45,324 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:45,324 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:45,324 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 10 states. [2018-09-19 16:19:46,485 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:47,451 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-09-19 16:19:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:47,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-09-19 16:19:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:47,454 INFO L225 Difference]: With dead ends: 90 [2018-09-19 16:19:47,454 INFO L226 Difference]: Without dead ends: 57 [2018-09-19 16:19:47,455 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:19:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-19 16:19:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-19 16:19:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-19 16:19:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-19 16:19:47,460 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 57 [2018-09-19 16:19:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:47,460 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-19 16:19:47,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-19 16:19:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-19 16:19:47,462 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:47,462 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:47,463 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash -245978473, now seen corresponding path program 1 times [2018-09-19 16:19:47,463 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:47,464 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:47,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:47,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:47,732 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:19:47,737 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:19:47,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,758 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:19:47,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:47,823 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:19:47,833 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:19:47,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,849 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:19:47,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:48,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:48,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:48,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 16:19:48,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 16:19:48,191 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 16:19:48,191 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:19:48,192 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 15 states. [2018-09-19 16:19:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:50,223 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-19 16:19:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:19:50,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-09-19 16:19:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:50,226 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:50,226 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:19:50,227 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-09-19 16:19:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:19:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:19:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:19:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:19:50,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2018-09-19 16:19:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:50,229 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:19:50,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 16:19:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:19:50,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:19:50,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:19:50,542 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2018-09-19 16:19:50,549 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-19 16:19:50,549 INFO L426 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-09-19 16:19:50,549 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-19 16:19:50,549 INFO L426 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 23 48) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L27-2(line 27) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L429 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 23 48) the Hoare annotation is: true [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-19 16:19:50,550 INFO L426 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L422 ceAbstractionStarter]: At program point L26-3(lines 26 31) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 23 48) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L26-4(lines 23 48) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-09-19 16:19:50,551 INFO L429 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 50 58) the Hoare annotation is: true [2018-09-19 16:19:50,551 INFO L426 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L422 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (= fmax_double_~x |fmax_double_#in~x|))) (or (and .cse0 (= fmax_double_~y |fmax_double_#in~y|)) (and .cse0 (or (exists ((v_prenex_3 (_ BitVec 64))) (and (not (bvuge ((_ extract 63 32) v_prenex_3) (_ bv2147483648 32))) (= (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)) |fmax_double_#in~x|))) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) |fmax_double_#in~x|) (not (bvule ((_ extract 63 32) |v_q#valueAsBitvector_7|) (_ bv2148532223 32))))))))) [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 54 55) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L422 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point L52-1(lines 52 53) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 50 58) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 50 58) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-09-19 16:19:50,552 INFO L426 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L66-2(line 66) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L64-1(line 64) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L64-2(line 64) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L64-3(line 64) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L422 ceAbstractionStarter]: At program point L63-3(lines 63 67) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 60 70) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point L63-4(lines 63 67) no Hoare annotation was computed. [2018-09-19 16:19:50,553 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 60 70) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 60 70) the Hoare annotation is: true [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 16:19:50,554 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 72 90) the Hoare annotation is: true [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 72 90) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L426 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-09-19 16:19:50,554 INFO L422 ceAbstractionStarter]: At program point L84-1(line 84) the Hoare annotation is: (and (= (_ +zero 11 53) main_~res~0) |main_#t~short11| (= (_ +zero 11 53) main_~y~0) (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-09-19 16:19:50,555 INFO L426 ceAbstractionStarter]: For program point L84-2(line 84) no Hoare annotation was computed. [2018-09-19 16:19:50,555 INFO L422 ceAbstractionStarter]: At program point L81(line 81) the Hoare annotation is: (and (= (_ +zero 11 53) main_~y~0) (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-09-19 16:19:50,555 INFO L426 ceAbstractionStarter]: For program point L81-1(line 81) no Hoare annotation was computed. [2018-09-19 16:19:50,555 INFO L426 ceAbstractionStarter]: For program point L84-4(lines 84 87) no Hoare annotation was computed. [2018-09-19 16:19:50,555 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 72 90) no Hoare annotation was computed. [2018-09-19 16:19:50,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:19:50 BoogieIcfgContainer [2018-09-19 16:19:50,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:19:50,569 INFO L168 Benchmark]: Toolchain (without parser) took 19398.58 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -898.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:50,570 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:50,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.89 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:50,571 INFO L168 Benchmark]: Boogie Preprocessor took 56.82 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:50,572 INFO L168 Benchmark]: RCFGBuilder took 836.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:50,572 INFO L168 Benchmark]: TraceAbstraction took 18055.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -129.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:50,576 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.89 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.82 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 836.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18055.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -129.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: 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: 26]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 1 error locations. SAFE Result, 17.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 690 SDtfs, 261 SDslu, 2789 SDs, 0 SdLazy, 1014 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 41 PreInvPairs, 50 NumberOfFragments, 85 HoareAnnotationTreeSize, 41 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 557 ConstructedInterpolants, 86 QuantifiedInterpolants, 116800 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1232 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 126/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...