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_1251b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:19:24,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:19:24,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:19:24,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:19:24,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:19:24,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:19:24,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:19:24,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:19:24,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:19:24,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:19:24,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:19:24,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:19:24,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:19:24,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:19:24,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:19:24,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:19:24,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:19:24,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:19:24,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:19:24,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:19:24,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:19:24,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:19:24,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:19:24,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:19:24,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:19:24,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:19:24,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:19:24,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:19:24,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:19:24,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:19:24,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:19:24,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:19:24,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:19:24,728 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:19:24,731 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:19:24,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:19:24,732 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:24,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:19:24,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:19:24,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:19:24,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:19:24,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:19:24,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:19:24,766 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:19:24,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:19:24,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:19:24,766 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:19:24,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:19:24,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:19:24,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:19:24,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:19:24,767 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:19:24,768 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:19:24,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:19:24,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:19:24,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:19:24,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:19:24,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:19:24,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:19:24,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:19:24,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:19:24,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:19:24,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:19:24,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:19:24,770 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:19:24,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:19:24,770 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:19:24,771 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:19:24,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:19:24,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:19:24,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:19:24,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:19:24,836 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:19:24,837 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:19:24,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-19 16:19:25,213 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c526fc8e9/1f995e83b11e43d782d239eaa27852ce/FLAGf81420980 [2018-09-19 16:19:25,401 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:19:25,402 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-19 16:19:25,411 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c526fc8e9/1f995e83b11e43d782d239eaa27852ce/FLAGf81420980 [2018-09-19 16:19:25,428 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c526fc8e9/1f995e83b11e43d782d239eaa27852ce [2018-09-19 16:19:25,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:19:25,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:19:25,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:25,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:19:25,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:19:25,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:25" (1/1) ... [2018-09-19 16:19:25,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b36ba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:25, skipping insertion in model container [2018-09-19 16:19:25,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:25" (1/1) ... [2018-09-19 16:19:25,465 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:19:25,669 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:25,690 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:19:25,707 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:25,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:25 WrapperNode [2018-09-19 16:19:25,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:25,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:19:25,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:19:25,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:19:25,763 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:25" (1/1) ... [2018-09-19 16:19:25,763 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:25" (1/1) ... [2018-09-19 16:19:25,777 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:25" (1/1) ... [2018-09-19 16:19:25,778 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:25" (1/1) ... [2018-09-19 16:19:25,785 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:25" (1/1) ... [2018-09-19 16:19:25,791 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:25" (1/1) ... [2018-09-19 16:19:25,793 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:25" (1/1) ... [2018-09-19 16:19:25,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:19:25,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:19:25,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:19:25,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:19:25,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:25" (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:25,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:19:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:19:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:19:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-19 16:19:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-19 16:19:25,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:19:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:19:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:19:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:19:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-19 16:19:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:19:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:19:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:19:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:19:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-19 16:19:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:19:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:19:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:19:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:19:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:19:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:19:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:19:26,375 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:26,404 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:26,431 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:26,593 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:19:26,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:26 BoogieIcfgContainer [2018-09-19 16:19:26,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:19:26,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:19:26,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:19:26,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:19:26,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:19:25" (1/3) ... [2018-09-19 16:19:26,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc68cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:26, skipping insertion in model container [2018-09-19 16:19:26,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:25" (2/3) ... [2018-09-19 16:19:26,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc68cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:26, skipping insertion in model container [2018-09-19 16:19:26,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:26" (3/3) ... [2018-09-19 16:19:26,603 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-09-19 16:19:26,614 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:19:26,624 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:19:26,674 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:19:26,675 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:19:26,675 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:19:26,675 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:19:26,676 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:19:26,676 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:19:26,676 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:19:26,676 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:19:26,676 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:19:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-19 16:19:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 16:19:26,705 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:26,706 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] [2018-09-19 16:19:26,708 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1700649700, now seen corresponding path program 1 times [2018-09-19 16:19:26,722 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:26,723 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:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:26,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:26,849 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:26,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:26,866 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:26,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:19:26,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:19:26,882 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:19:26,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:19:26,884 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-19 16:19:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:26,909 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-19 16:19:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:19:26,911 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-19 16:19:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:26,922 INFO L225 Difference]: With dead ends: 88 [2018-09-19 16:19:26,922 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:26,927 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-19 16:19:26,971 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-19 16:19:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:26,972 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-19 16:19:26,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:19:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-19 16:19:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-19 16:19:26,974 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:26,975 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:26,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1378721572, now seen corresponding path program 1 times [2018-09-19 16:19:26,976 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:26,976 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:26,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:27,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:27,161 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:27,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:27,178 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:27,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:27,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:27,180 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:27,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:27,181 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-19 16:19:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:27,259 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-19 16:19:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:27,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-19 16:19:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:27,263 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:27,264 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:27,265 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:27,276 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-19 16:19:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:27,277 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-19 16:19:27,279 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:27,279 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:27,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1304320947, now seen corresponding path program 1 times [2018-09-19 16:19:27,280 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:27,280 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:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:27,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:27,415 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:27,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:27,430 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:27,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:27,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:27,431 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:27,431 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:27,432 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:27,518 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:27,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-19 16:19:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:27,521 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:27,522 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:27,522 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:27,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-19 16:19:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:27,533 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:27,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 16:19:27,535 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:27,535 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:27,536 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1932752128, now seen corresponding path program 1 times [2018-09-19 16:19:27,537 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:27,537 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:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:27,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:27,661 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:27,661 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:27,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:27,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:27,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:27,686 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:27,686 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:27,686 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:27,817 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:27,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-19 16:19:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:27,819 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:27,819 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:27,820 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:27,828 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-19 16:19:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:27,828 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:27,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:27,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:27,831 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:27,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1420834481, now seen corresponding path program 1 times [2018-09-19 16:19:27,832 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:27,832 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:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:27,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:27,959 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:27,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:27,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:27,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:27,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:27,973 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:27,973 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:27,973 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:28,015 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:28,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-19 16:19:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:28,017 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:28,018 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:28,018 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:28,025 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-19 16:19:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:28,026 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:28,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:28,027 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:28,028 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:28,028 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash -386619982, now seen corresponding path program 1 times [2018-09-19 16:19:28,029 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:28,029 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:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:28,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:28,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:28,720 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:28,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:19:28,740 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:28,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:28,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:28,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:28,863 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:28,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:29,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:29,591 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:29,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-19 16:19:29,645 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:29,729 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-09-19 16:19:29,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:19:29,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:29,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:19:29,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:19:29,921 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:29,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:19:29,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,956 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:29,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:19:30,483 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-09-19 16:19:30,757 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-09-19 16:19:31,210 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:31,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:31,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:31,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 16:19:31,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 16:19:31,225 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 16:19:31,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:19:31,226 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 16 states. [2018-09-19 16:19:32,959 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:19:33,773 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:40,947 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-09-19 16:19:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:42,593 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-09-19 16:19:42,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 16:19:42,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-09-19 16:19:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:42,597 INFO L225 Difference]: With dead ends: 66 [2018-09-19 16:19:42,597 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:42,599 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=120, Invalid=634, Unknown=2, NotChecked=0, Total=756 [2018-09-19 16:19:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-09-19 16:19:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-19 16:19:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-19 16:19:42,606 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2018-09-19 16:19:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:42,606 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-19 16:19:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 16:19:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-19 16:19:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-19 16:19:42,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:42,608 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] [2018-09-19 16:19:42,609 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1132927488, now seen corresponding path program 1 times [2018-09-19 16:19:42,609 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:42,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:42,773 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:42,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:42,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:42,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:42,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:42,792 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:42,792 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:42,792 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-09-19 16:19:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:42,840 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-09-19 16:19:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:42,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-19 16:19:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:42,842 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:42,842 INFO L226 Difference]: Without dead ends: 51 [2018-09-19 16:19:42,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-19 16:19:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-19 16:19:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-19 16:19:42,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 58 [2018-09-19 16:19:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:42,850 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-19 16:19:42,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-19 16:19:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-19 16:19:42,852 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:42,852 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, 1, 1] [2018-09-19 16:19:42,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash 310309699, now seen corresponding path program 1 times [2018-09-19 16:19:42,853 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:42,853 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:42,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:42,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:42,977 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:42,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:42,989 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:42,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:42,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:42,990 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:42,990 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:42,991 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 4 states. [2018-09-19 16:19:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:43,035 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-19 16:19:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:43,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-19 16:19:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:43,037 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:43,038 INFO L226 Difference]: Without dead ends: 54 [2018-09-19 16:19:43,038 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-19 16:19:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-19 16:19:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-19 16:19:43,045 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 59 [2018-09-19 16:19:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-19 16:19:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-19 16:19:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:43,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:43,047 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] [2018-09-19 16:19:43,048 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1101257373, now seen corresponding path program 1 times [2018-09-19 16:19:43,048 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:43,049 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,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:43,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:43,212 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:43,218 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:43,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,241 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:43,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:43,347 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:43,352 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:43,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,365 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:43,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:43,795 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:43,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:43,807 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:43,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:43,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:43,808 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:43,808 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:43,809 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 10 states. [2018-09-19 16:19:45,185 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:19:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:45,809 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-09-19 16:19:45,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:45,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-09-19 16:19:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:45,812 INFO L225 Difference]: With dead ends: 62 [2018-09-19 16:19:45,812 INFO L226 Difference]: Without dead ends: 53 [2018-09-19 16:19:45,813 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 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:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-19 16:19:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-19 16:19:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-19 16:19:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-19 16:19:45,820 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 60 [2018-09-19 16:19:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:45,822 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-19 16:19:45,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-19 16:19:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:45,823 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:45,823 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, 1, 1, 1] [2018-09-19 16:19:45,823 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash -833861020, now seen corresponding path program 1 times [2018-09-19 16:19:45,824 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:45,824 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:45,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:45,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:45,968 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:45,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:45,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:45,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:45,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:45,981 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:45,981 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:45,981 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-09-19 16:19:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:46,021 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-09-19 16:19:46,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:46,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-19 16:19:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:46,024 INFO L225 Difference]: With dead ends: 62 [2018-09-19 16:19:46,024 INFO L226 Difference]: Without dead ends: 56 [2018-09-19 16:19:46,025 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-19 16:19:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-19 16:19:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-19 16:19:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-19 16:19:46,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 60 [2018-09-19 16:19:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-19 16:19:46,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-19 16:19:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:46,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:46,035 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, 1, 1, 1, 1] [2018-09-19 16:19:46,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 777757472, now seen corresponding path program 1 times [2018-09-19 16:19:46,036 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:46,036 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:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:46,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:46,203 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:46,209 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:46,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,234 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:46,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:46,282 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:46,287 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:46,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,304 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:46,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:46,697 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:46,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:46,715 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:46,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:46,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:46,716 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:46,716 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:46,716 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 10 states. [2018-09-19 16:19:47,987 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:19:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:48,846 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-09-19 16:19:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:48,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-19 16:19:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:48,849 INFO L225 Difference]: With dead ends: 64 [2018-09-19 16:19:48,849 INFO L226 Difference]: Without dead ends: 55 [2018-09-19 16:19:48,849 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 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:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-19 16:19:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-09-19 16:19:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-19 16:19:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-19 16:19:48,857 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 61 [2018-09-19 16:19:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:48,857 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-19 16:19:48,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-19 16:19:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:48,859 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:48,859 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, 1, 1, 1, 1] [2018-09-19 16:19:48,859 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -583298201, now seen corresponding path program 1 times [2018-09-19 16:19:48,860 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:48,860 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:48,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:48,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:49,015 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:49,015 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:49,026 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:49,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:49,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:49,027 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:49,027 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:49,027 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-09-19 16:19:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:49,090 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-19 16:19:49,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:49,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-19 16:19:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:49,091 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:49,091 INFO L226 Difference]: Without dead ends: 54 [2018-09-19 16:19:49,092 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-19 16:19:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-19 16:19:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:19:49,098 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 61 [2018-09-19 16:19:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:49,099 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:19:49,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:19:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:49,100 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:49,100 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, 1, 1, 1, 1] [2018-09-19 16:19:49,100 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:49,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1904214632, now seen corresponding path program 1 times [2018-09-19 16:19:49,101 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:49,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:49,283 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:49,290 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:49,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:49,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:49,310 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:49,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:49,359 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:49,374 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:49,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:49,483 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:49,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:50,393 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:50,797 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:51,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:52,127 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:52,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:52,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 16:19:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:52,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:19:53,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:53,833 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 16:19:54,494 WARN L178 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:19:54,649 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:19:54,782 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:19:55,278 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:19:55,737 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:55,759 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:55,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 10] total 24 [2018-09-19 16:19:55,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-19 16:19:55,760 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-19 16:19:55,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-09-19 16:19:55,760 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2018-09-19 16:19:58,873 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-19 16:19:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:59,176 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-09-19 16:19:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 16:19:59,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-09-19 16:19:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:59,178 INFO L225 Difference]: With dead ends: 71 [2018-09-19 16:19:59,178 INFO L226 Difference]: Without dead ends: 61 [2018-09-19 16:19:59,179 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 16:19:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-19 16:19:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-09-19 16:19:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-19 16:19:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-19 16:19:59,186 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 61 [2018-09-19 16:19:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:59,186 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-19 16:19:59,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-19 16:19:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-19 16:19:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 16:19:59,187 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:59,187 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, 1, 1, 1, 1, 1] [2018-09-19 16:19:59,188 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash 741324289, now seen corresponding path program 1 times [2018-09-19 16:19:59,188 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:59,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:59,371 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:59,376 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:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:59,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:59,402 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:59,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:59,444 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:59,448 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:59,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:59,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:59,465 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:59,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:59,753 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:59,753 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:59,768 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:59,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:59,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:59,769 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:59,770 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:59,770 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 10 states. [2018-09-19 16:20:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:02,766 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-09-19 16:20:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:20:02,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-09-19 16:20:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:02,769 INFO L225 Difference]: With dead ends: 63 [2018-09-19 16:20:02,770 INFO L226 Difference]: Without dead ends: 54 [2018-09-19 16:20:02,770 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:20:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-19 16:20:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-09-19 16:20:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-19 16:20:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-19 16:20:02,780 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 62 [2018-09-19 16:20:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:02,780 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-19 16:20:02,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:20:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-19 16:20:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 16:20:02,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:02,782 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, 1, 1, 1, 1, 1, 1] [2018-09-19 16:20:02,783 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1014024772, now seen corresponding path program 1 times [2018-09-19 16:20:02,783 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:02,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:20:02,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:02,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:02,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:02,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:02,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:20:02,977 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:02,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:20:02,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,032 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:20:03,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:20:03,187 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:03,187 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:03,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-19 16:20:03,197 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:03,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:20:03,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:20:03,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:20:03,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:20:03,455 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:03,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:20:03,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:20:03,556 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:20:03,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:20:03,900 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:20:03,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:03,912 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:03,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 16:20:03,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:20:03,913 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:20:03,913 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:20:03,913 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-09-19 16:20:06,447 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:20:07,155 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:20:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:07,638 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-09-19 16:20:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:20:07,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-09-19 16:20:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:07,640 INFO L225 Difference]: With dead ends: 59 [2018-09-19 16:20:07,640 INFO L226 Difference]: Without dead ends: 50 [2018-09-19 16:20:07,640 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-09-19 16:20:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-19 16:20:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-09-19 16:20:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-19 16:20:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-09-19 16:20:07,645 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 63 [2018-09-19 16:20:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:07,645 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-09-19 16:20:07,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:20:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-09-19 16:20:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 16:20:07,646 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:20:07,646 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, 1, 1, 1, 1, 1, 1] [2018-09-19 16:20:07,647 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:20:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash -782926587, now seen corresponding path program 1 times [2018-09-19 16:20:07,647 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:20:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-19 16:20:07,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:20:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:20:07,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:20:07,763 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:20:07,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:20:07,774 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:20:07,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:20:07,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:20:07,775 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:20:07,775 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:20:07,775 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-09-19 16:20:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:20:07,791 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-09-19 16:20:07,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:20:07,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-09-19 16:20:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:20:07,792 INFO L225 Difference]: With dead ends: 48 [2018-09-19 16:20:07,792 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:20:07,793 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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:20:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:20:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:20:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:20:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:20:07,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-09-19 16:20:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:20:07,794 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:20:07,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:20:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:20:07,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:20:07,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:20:08,071 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:20:08,133 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 26 51) no Hoare annotation was computed. [2018-09-19 16:20:08,133 INFO L422 ceAbstractionStarter]: At program point L29-3(lines 29 34) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L29-4(lines 26 51) no Hoare annotation was computed. [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-09-19 16:20:08,134 INFO L429 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 26 51) the Hoare annotation is: true [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-09-19 16:20:08,134 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 26 51) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:20:08,135 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:20:08,136 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:20:08,136 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-19 16:20:08,136 INFO L426 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-09-19 16:20:08,136 INFO L422 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= fmax_double_~x |fmax_double_#in~x|))) (or (and .cse0 (exists ((v_prenex_12 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12)) |fmax_double_#in~x|) (not (bvule ((_ extract 63 32) v_prenex_12) (_ bv4293918719 32))) (not (= (_ bv0 32) ((_ extract 31 0) v_prenex_12)))))) (and .cse0 (= fmax_double_~y |fmax_double_#in~y|)))) [2018-09-19 16:20:08,136 INFO L429 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 53 61) the Hoare annotation is: true [2018-09-19 16:20:08,136 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L422 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point L55-1(lines 55 56) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 53 61) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 53 61) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 16:20:08,137 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 63 84) the Hoare annotation is: true [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 63 84) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-19 16:20:08,137 INFO L426 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2018-09-19 16:20:08,138 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 63 84) no Hoare annotation was computed. [2018-09-19 16:20:08,138 INFO L422 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (and (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) (fp.eq main_~x~0 main_~x~0)) [2018-09-19 16:20:08,138 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-19 16:20:08,138 INFO L422 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) [2018-09-19 16:20:08,138 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 72 81) no Hoare annotation was computed. [2018-09-19 16:20:08,138 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2018-09-19 16:20:08,138 INFO L426 ceAbstractionStarter]: For program point L72-3(lines 72 81) no Hoare annotation was computed. [2018-09-19 16:20:08,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:20:08 BoogieIcfgContainer [2018-09-19 16:20:08,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:20:08,151 INFO L168 Benchmark]: Toolchain (without parser) took 42713.27 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 871.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -356.6 MB). Peak memory consumption was 514.7 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:08,152 INFO L168 Benchmark]: CDTParser took 0.25 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:20:08,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.37 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:20:08,154 INFO L168 Benchmark]: Boogie Preprocessor took 52.23 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:20:08,154 INFO L168 Benchmark]: RCFGBuilder took 795.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:08,155 INFO L168 Benchmark]: TraceAbstraction took 41554.92 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.0 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 411.6 MB). Peak memory consumption was 529.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:08,158 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.25 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 303.37 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 52.23 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 795.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41554.92 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.0 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 411.6 MB). Peak memory consumption was 529.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: 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: 29]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. SAFE Result, 41.4s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 726 SDtfs, 334 SDslu, 2285 SDs, 0 SdLazy, 1440 SolverSat, 43 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1027 GetRequests, 880 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 16 MinimizatonAttempts, 41 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 66 HoareAnnotationTreeSize, 18 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 936 ConstructedInterpolants, 123 QuantifiedInterpolants, 245704 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 196/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...